Author:
Goldsmith Judy,Hemachandra Lane A.,Kunen Kenneth
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. L. Adleman. Time, space, and randomness. Technical Report MIT/LCS/TM-131, MIT, Cambridge, MA, April 1979.
2. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193–1202, 1988.
3. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing, 4(4):431–442, 1975.
4. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305–322, 1977.
5. R. Book. Bounded query machines: On NP and PSPACE. Theoretical Computer Science, 15:27–39, 1981.