On Some SAT-Variants over Linear Formulas

DOI10.1007/978-3-540-95891-8_41zbMath1206.68151OpenAlexW1561517399MaRDI QIDQ3599093

Tatjana Schmidt, Stefan Porschen

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_41

zbMATH Keywords

linear hypergraphexact satisfiabilitylinear formulabicolorabilitynot-all-equal satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

XSAT and NAE-SAT of linear CNF classes

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of Fisher's inequality
• Linear CNF formulas and satisfiability
• Axioms and hulls
• New algorithms for exact satisfiability
• The Non-Existence of Finite Projective Planes of Order 10
• A CNF Class Generalizing Exact Linear Formulas
• The complexity of satisfiability problems

This page was built for publication: On Some SAT-Variants over Linear Formulas