Advertisement

Generalized Satisfiability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity

  • Victor Dalmau
  • Daniel K. Ford
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2747)

Abstract

In this paper we examine generalized satisfiability problems with limited variable occurrences. First, we show that 3 occurrences per variable suffice to make these problems as hard as their unrestricted version. Then we focus on generalized satisfiability problems with at most 2 occurrences per variable. It is known that some NP -complete generalized satisfiability problems become polynomially solvable when only 2 occurrences per variable are allowed. We identify two new families of generalized satisfiability problems, called local and binary, that are polynomially solvable when only 2 occurrences per variable are allowed. We achieve this result by means of a reduction to the \(\triangle\)-matroid parity problem, which is another important theme of this work.

Keywords

Polynomial Time Atomic Formula Graph Match Local Path Variable Occurrence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Victor Dalmau
    • 1
  • Daniel K. Ford
    • 2
  1. 1.Universitat Pompeu Fabra 
  2. 2.UC Santa Cruz 

Personalised recommendations