Abstract
We investigate the computational complexity of the exact satisfiability problem (XSAT) restricted to certain subclasses of linear CNF formulas. These classes are defined through restricting the number of occurrences of variables and are therefore interesting because the complexity status does not follow from Schaefer’s theorem [14,7]. Specifically we prove that XSAT remains NP-complete for linear formulas which are monotone and all variables occur exactly l times. We also present some complexity results for exact linear formulas left open in [9]. Concretely, we show that XSAT for this class is NP-complete, in contrast to SAT or NAE-SAT. This can also be established when clauses have length at least k, for fixed integer k ≥ 3. However, the XSAT-complexity for exact linear formulas with clause length exactly k remains open, but we provide its polynomial-time behaviour at least for every positive integer k ≤ 6.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
Byskov, J.M., Ammitzboll Madsen, B., Skjernaa, B.: New Algorithms for Exact Satisfiability. Theoretical Comp. Sci. 332, 515–541 (2005)
Chataigner, F., Manic, G., Wakabayashi, Y., Yuster, R.: Approximation algorithms and hardness results for the clique packing problem. Discrete Appl. Math. 157, 1396–1406 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)
Hell, P., Kirkpatrick, D.G.: On the complexity of general k-factor problems. SIAM J. Comput. 12, 601–609 (1983)
Knuth, D.E.: Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992)
Kratochvil, J., Savicky, P., Tusa, Z.: One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput. 22, 203–210 (1993)
Palisse, R.: A short proof of Fisher’s inequality. Discrete Math. 111, 421–422 (1993)
Porschen, S., Schmidt, T.: On Some SAT-Variants over Linear Formulas. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 449–460. Springer, Heidelberg (2009)
Porschen, S., Randerath, H., Speckenmeyer, E.: Linear-Time Algorithms for some Not-All-Equal Satisfiability Problems. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 172–187. Springer, Heidelberg (2004)
Porschen, S., Speckenmeyer, E.: Algorithms for Variable-Weighted 2-SAT and Dual Problems. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 173–186. Springer, Heidelberg (2007)
Porschen, S., Speckenmeyer, E., Zhao, X.: Linear CNF formulas and satisfiability. Discrete Appl. Math. 157, 1046–1068 (2009)
Ryser, H.J.: Combinatorial Mathematics. Carus Mathematical Monographs 14, Mathematical Association of America (1963)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC 1978, pp. 216–226. ACM, New York (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porschen, S., Schmidt, T., Speckenmeyer, E. (2010). Complexity Results for Linear XSAT-Problems . In: Strichman, O., Szeider, S. (eds) Theory and Applications of Satisfiability Testing – SAT 2010. SAT 2010. Lecture Notes in Computer Science, vol 6175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14186-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-14186-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14185-0
Online ISBN: 978-3-642-14186-7
eBook Packages: Computer ScienceComputer Science (R0)