1. Relativizations of the P = ? NP Question;Baker;SIAM J. Comput.,1975
2. The complexity of theorem-proving procedures;Cook,1971
3. Foundations of Modern Analysis;Dieudonné,1969
4. On the complexity of computations under varying sets of primitives;Dobkin;Proc. Second GI-Symposium on Automata Theory and Formal Languages,1975
5. A nonlinear lower bound on linear search tree programs for solving knapsack problems;Dobkin;J. Comput. System Sci.,1976