scientific article; zbMATH DE number 1113997

MaRDI QIDQ4375762zbMATH OpenFDO

Authors K. Takaki, Kazuo Iwama

Publication date 1 October 1998

zbMATH Keywords

3CNF formulas

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Parallel algorithms in computer science (68W10)

Recommendations

• On the satisfiability threshold of formulas with three literals per clause
• Satisfiability of acyclic and almost acyclic CNF formulas
• Satisfiability of acyclic and almost acyclic CNF formulas
• scientific article; zbMATH DE number 437557
• scientific article; zbMATH DE number 1954174
• The complexity of constraint satisfaction problems for small relation algebras
• Computational complexity of some restricted instances of 3-SAT
• A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable
• Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
• The Existence of Unsatisfiable Formulas in k-LCNF for k ≥ 3

Cited in

(4)

• Partial Satisfaction of k-Satisfiable Formulas
• Planar 3-SAT with a clause/variable cycle
• On the parameterized complexity of \((k,s)\)-SAT
• Computational complexity of some restricted instances of 3-SAT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375762)