Generalized satisfiability with limited occurrences per variable: A study through delta-matroid parity

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

Volumn 2747, Issue , 2003, Pages 358-367

  Dalmau, Victor ^a   Ford, Daniel K ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; PROBLEM SOLVING;

NP COMPLETE; PARITY PROBLEMS; POLYNOMIALLY SOLVABLE; SATISFIABILITY; SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 33749543360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_30     Document Type: Article

References (17)

1. C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U.S.A., 43:842-844, 1957.
2. A. Bouchet and W. H. Cunningham. Delta-matroids, jump systems, and bisubmodular polyhedra. SIAM J. Discrete Math., 8(1):17-32, 1995.
3. A. Bouchet. Representability of Δ-matroids. In Combinatorics, pages 167-182. 1988.
4. A. Bouchet. Coverings and delta-coverings. In Integer programming and combinatorial optimization (Copenhagen, 1995), pages 228-243.
5. N. Creignou, S. Khanna, and M. Sudan. Complexity classifications of Boolean constraint satisfaction problems. SIAM 2001.
6. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449-467, 1965.
7. T. Feder. Fanout limitations on constraint systems. Th. Comp. Sci., 255(1-2):281-293, 2001.
8. M. R. Garey and D. S. Johnson. Computers and intractability. 1979.
9. J. Geelen, S. Iwata, and K. Murota. The linear delta-matroid parity problem. Technical Report RIMS Preprint 1149, Kyoto University, 1997.
10. G. I. Istrate. Looking for a version of schaeer's dichotomy theorem when each variable occurs at most twice. Technical Report TR652, The University of Rochester, March 1997.
11. J. Kratochvíl, P. Savický, and Z. Tuza. One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput., 22(1):203-210, 1993.
12. R. E. Ladner. On the structure of polynomial time reducibility. J. Assoc. Comput. Mach., 22:155-171, 1975.
13. L. Lovász and M. D. Plummer. Matching Theory. 1986.
14. L. Lovász. The membership problem in jump systems. J. Comb. Th. (B), 70(1):45-66, 1997.
15. L. Lovász. The matroid matching problem. In Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), pages 495-517.
16. T. J. Schaefer. The complexity of satisfiability problems. In Theory of Computing. 1978.
17. Craig A. Tovey. A simplified NP-complete satisfiability problem. Discrete Appl. Math., 8(1):85-89, 1984.