scientific article; zbMATH DE number 1775445

zbMATH Open1028.68068MaRDI QIDQ4542577FDOQ4542577

Authors: Michael Freedman 

Publication date: 1 August 2002

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of satisfiability problems
• A simplified NP-complete satisfiability problem
• On the complexity of \(k\)-SAT
• scientific article; zbMATH DE number 152108
• NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k )

zbMATH Keywords

general Boolean formula

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• Boolean formulae, hypergraphs and combinatorial topology
• Determining the <I>SHOIN(D)</I>-Satisfiability with a Complete Disjunctive Normal Form Group
• Periodic constraint satisfaction problems: Tractable subclasses

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 Q4542577)