On relativization and the existence of complete sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 140 LNCS, Issue , 1982, Pages 523-531

  Sipser, Michael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84956213714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0012797     Document Type: Conference Paper

References (3)

1. Adleman, L. "Two theorems on random polynomial time", 19th Annual Symposium on Foundations of Computer Science, 1978.
2. Baker, Gill, Solovay, "Relativizations of the P = ? NP question," SICOMP 1977. Kannan, Unpublished.
3. Rackoff, Relativized questions involving probabilistic algorithms, JACM V. 29, 1982, p. 261.