Generalizations of matched CNF formulas

Annals of Mathematics and Artificial Intelligence

Volumn 43, Issue 1-4, 2005, Pages 223-238

  Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

biclique cover; bipartite graph; deficiency; matched formula; NP completeness; polynomial hierarchy; SAT problem

Indexed keywords

EID: 10344225692     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-0432-6     Document Type: Article

References (18)

1. R. Aharoni and N. Linial, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, J. Combin. Theory Ser. A 43 (1986) 196-204.
2. R. Diestel, Graph Theory, 2nd ed., Graduate Texts in Mathematics, Vol. 173 (Springer, New York, 2000).
3. R.G. Downey and M.R. Fellows, Parameterized Complexity (Springer, 1999).
4. T. Eiter and G. Gottlob, Complexity results for some eigenvector problems, International Journal of Computer Mathematics 76(1) (2000) 59-74.
5. H. Fleischner, O. Kullmann and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference, Theoretical Computer Science 289(1) (2002) 503-516.
6. J. Franco and A. Van Gelder, A perspective on certain polynomial time solvable classes of satisfiability, Discrete Applied Mathematics 125 (2003) 177-214.
7. M.R. Garey and D.R. Johnson, Computers and Intractability (Freeman, New York, 1979).
8. P. Hell, Graph packings, in: Proceedings for the 6th International Conference on Graph Theory, ed. I. Rusu, Electronic Notes in Discrete Mathematics, Vol. 5 (2000).
9. H. Kleine Büning and T. Lettman, Propositional Logic: Deduction and Algorithms (Cambridge Univ. Press, Cambridge, 1999).
10. H. Kleine Büning and X. Zhao, Satisfiable formulas closed under replacement, in: Proceedings for the Workshop on Theory and Applications of Satisfiability, eds. H. Kautz and B. Selman, Electronic Notes in Discrete Mathematics, Vol. 9 (2001).
11. O. Kullmann, Investigations on autark assignments, Discrete Applied Mathematics 107(1-3) (2000) 99-137.
12. O. Kullmann, Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets, Discrete Applied Mathematics 130(2) (2003) 209-249.
13. L. Lovász and M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, Vol. 29 (North-Holland, Amsterdam, 1986).
14. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).
15. M. Schaefer, Completeness in the polynomial-time hierarchy, Technical Report TR01-009, School of CTI, DePaul University, Chicago, IL (2001).
16. L.J. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science 3(1) (1976) 1-22.
17. S. Szeider, Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable, in: Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03), eds. T. Warnow and B. Zhu, Lecture Notes in Computer Science, Vol. 2697 (2003) pp. 548-558.
18. C.A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics 8(1) (1984) 85-89.