7 search results - page 2 / 2 » Minimum 2CNF Resolution Refutations in Polynomial Time |
FOCS
2006
IEEE
13 years 9 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...