Abstract
There are “worlds” in which P = NP and others in which P ≠ NP. Furthermore, if a “world” is chosen at random, the probability is 1 that it will be a world in which P ≠ NP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Baker, J. Gill, R. Solovay: Relativizations of the P=?NP question, SIAM Journal on Computing 4 (1975), 431–442.
C.H. Bennett, J. Gill: Relative to a random oracle A, PA / NPA / coNPA with probability 1, SIAM Journal on Computing 10 (1981), 96–113
R. Chang, B. Chor, O. Goldreich, et al: The random oracle hypothesis is false, Journal of Computer and System Sciences 49 (1994), 24–39.
S. Kurtz: On the random oracle hypothesis, Information and Control 57 (1983), 40–47.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). P ≠ NP with probability 1. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive