On relativization and the existence of complete sets

  • Michael Sipser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Michael Sipser
    • 1
  1. 1.Mathematics DepartmentMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations