SAT 2007
Minimum 2CNF Resolution Refutations in Polynomial Time
Abstract
Abstract We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Conference on Theory and Applications of Satisfiability Testing
- Archive span
- 2003-2025
- Indexed papers
- 824
- Paper id
- 191721954444150115