The unreasonable effectiveness of alternation-based satisfiabiity algorithms

MaRDI QIDQ2741530zbMATH OpenFDO

Authors Tom Morrisette

Publication date 24 September 2001

zbMATH Keywords

implication graphSAT problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 956858
• Experimental comparison of 2-satisfiability algorithms
• scientific article; zbMATH DE number 956861
• Solving satisfiability using decomposition and the most constrained subproblem
• A dual algorithm for the satisfiability problem

Cited in

(1)

• Solving satisfiability using decomposition and the most constrained subproblem

This page was built for publication: The unreasonable effectiveness of alternation-based satisfiabiity algorithms

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