A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Towards NP–P via proof complexity and search
2012
Annals of Pure and Applied Logic
Preserved Fulltext
This is a survey of work on proof complexity and proof search from a logicoalgorithmic viewpoint, as motivated by the P versus NP problem. We discuss propositional proof complexity, Cook's program, proof automatizability, proof search, algorithms for satisfiability, and the state of the art of our (in)ability to separate P and NP.
doi:10.1016/j.apal.2011.09.009
fatcat:oud37acsqfgrdio62ir6ci24xi