On the Complexity of Finding Narrow Proofs

foundations of computer science, Volume abs/1204.0775, 2012, Pages 351-360.

Cited by: 6|Bibtex|Views0|Links
EI WOS
Keywords:
3-cnf formularegular resolutionresolution refutationwidth-k refutationfinding narrow proofsMore(8+)

Abstract:

We study the complexity of the following "resolution width problem": Does a given 3-CNF formula have a resolution refutation of width k? For fixed k, refutations of width k can easily be found in polynomial time. We prove a matching polynomial lower bound for the resolution width problem that shows that there is no significant faster way ...More

Code:

Data:

Your rating :
0

 

Tags
Comments