Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical propositional logic (03B05) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Recommendations
Cited in
(18)- A CNF Class Generalizing Exact Linear Formulas
- Exponential complexity of satisfiability testing for linear-size Boolean formulas
- On the complexity of equational problems in CNF
- scientific article; zbMATH DE number 5613969 (Why is no real title available?)
- Unsatisfiable linear CNF formulas are large and complex
- Exact satisfiability of linear CNF formulas
- A linear-time transformation of linear inequalities into conjunctive normal form
- XSAT and NAE-SAT of linear CNF classes
- scientific article; zbMATH DE number 7204396 (Why is no real title available?)
- Linear CNF formulas and satisfiability
- scientific article; zbMATH DE number 810103 (Why is no real title available?)
- On Some SAT-Variants over Linear Formulas
- The Lovász Local Lemma and Satisfiability
- Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas
- A CNF Formula Hierarchy over the Hypercube
- The Existence of Unsatisfiable Formulas in k-LCNF for k ≥ 3
- The SAT problem of signed CNF formulas
- On extremal \(k\)-CNF formulas
This page was built for publication: On Linear CNF Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756579)
