Matched formulas and backdoor sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4501 LNCS, Issue , 2007, Pages 94-99

  Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PARAMETERIZATION;

BACKDOOR SETS; BOUNDED MAXIMUM DEFICIENCY; PARAMETER MAXIMUM DEFICIENCY;

PROBLEM SOLVING;

EID: 38049115719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_12     Document Type: Conference Paper

References (16)

1. R. Aharoni and N. Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A, 43:196-204, 1986.
2. B. Bidyuk and R. Dechter. On finding minimal w-cutset problem. UAI 2004, 20th Conference on Uncertainty in Artificial Intelligence, 2004.
3. S. Dantchev, B. Martin, and S. Szeider. Parameterized proof complexity: a complexity gap for parameterized tree-like resolution. Technical Report TR07-001, Electronic Colloquium on Computational Complexity (ECCC), Jan. 2007.
4. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, 1999.
5. H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoret. Comput. Sci., 289(1):503-516, 2002.
6. J. Flum and M. Grohe. Parameterized Complexity Theory, Springer Verlag, 2006.
7. I. Franco and A. Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability. Discr. Appl. Math., 125:177-214, 2003.
8. M. R. Garey and D. R. Johnson. Computers and Intractability. Freeman & Co., 1979.
9. H. Kleine Büning. On subclasses of minimal unsatisfiable formulas. Discr. Appl. Math., 107(1-3):83-98, 2000.
10. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
11. N. Nishimura, P. Ragde, and S. Szeider. Detecting backdoor sets with respect to Horn and binary clauses. In SAT 2004, Informal Proceedings, pages 96-103, 2004.
12. N. Nishimura, P. Ragde, and S. Szeider. Solving #SAT using vertex covers. In Proc. SAT 2006, volume 4121 of LNCS, pages 396-409, 2006.
13. S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. of Computer and System Sciences, 69(4):656-674, 2004.
14. S. Szeider. Generalizations of matched CNF formulas. Ann. Math. Artif. Intell., 43(1-4): 223-238, 2005.
15. C. A. Tovey. A simplified NP-complete satisfiability problem. Discr. Appl. Math., 8(1): 85-89, 1984.
16. R. Williams, C. Gomes, and B. Selman. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In SAT 2003, Informal Proceedings, pages 222-230, 2003.