*Related Questions on Metaculus:*

The P = NP problem is a famous open problem in computer science, first formally stated in 1971, that is also one of the Clay Institute's Millennium Prize Problems. Roughly speaking, it asks whether problems whose solutions can be verified efficiently can also be solved efficiently.

*When will P = NP be settled?*

This question will resolve on the date on which the Clay Institute's Millennium Prize is awarded for either a proof or a disproof of the statement that P = NP. If no such award takes place until the resolution time of the question, the question resolves as >.