Back to Search
Start Over
Towards NP–P via proof complexity and search
- Source :
- Annals of Pure and Applied Logic. (7):906-917
- Publisher :
- Elsevier B.V.
-
Abstract
- This is a survey of work on proof complexity and proof search from a logico-algorithmic 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.
Details
- Language :
- English
- ISSN :
- 01680072
- Issue :
- 7
- Database :
- OpenAIRE
- Journal :
- Annals of Pure and Applied Logic
- Accession number :
- edsair.core.ac.uk....b1108706619ebbc1d3d7a8b42610ee7a
- Full Text :
- https://doi.org/10.1016/j.apal.2011.09.009