Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)
On relativization and the existence of complete sets
Unable to display preview. Download preview PDF.
- Adleman, L. “Two theorems on random polynomial time”, 19th Annual Symposium on Foundations of Computer Science, 1978.Google Scholar
- Baker, Gill, Solovay, “Relativizations of the P = ? NP question,” SICOMP 1977.Google Scholar
- Kannan, Unpublished.Google Scholar
- Rackoff, Relativized questions involving probabilistic algorithms, JACM V. 29, 1982, p. 261.Google Scholar
© Springer-Verlag Berlin Heidelberg 1982