## The History and Status of the P versus NP Question (1992)

Citations: | 50 - 0 self |

### BibTeX

@MISC{Sipser92thehistory,

author = {Michael Sipser and Juris Hartmanis},

title = {The History and Status of the P versus NP Question},

year = {1992}

}

### Years of Citing Articles

### OpenURL

### Abstract

this article, I have attempted to organize and describe this literature, including an occasional opinion about the most fruitful directions, but no technical details. In the first half of this century, work on the power of formal systems led to the formalization of the notion of algorithm and the realization that certain problems are algorithmically unsolvable. At around this time, forerunners of the programmable computing machine were beginning to appear. As mathematicians contemplated the practical capabilities and limitations of such devices, computational complexity theory emerged from the theory of algorithmic unsolvability. Early on, a particular type of computational task became evident, where one is seeking an object which lies