1. T. Baker, J. Gill and R. Solovay, Relativizations of the P = ? NP question, SIAM J. Comput., to appear.
2. The complexity of theorem-proving procedures;Cook;Third annual ACM Symposium on Theory of Computing,1971
3. Formal Languages and Their Relation to Automata;Hopcroft,1969
4. Reducibility among combinatorial problems in log n space;Jones;Proc. of Seventh Annual Princeton Conference on Information Sciences and Systems,1973
5. Reducibility among combinatorial problems;Karp,1973