Samuel R. Buss.
"Towards NP-N and Satisfiability via Proof Search and Proof Complexity"
Logical Foundations of Computer Science (LFCS'09) - Plenary talk.
Deerfield Beach, Florida.
January 5, 2009.
Download talk slides: PDF.
Abstract: A survey of logical approaches to the P versus NP problem from the viewpoint of propositional proof complexity and proof search, and algorithms for satisfiability.
Back to Sam Buss's publications page.