Experimental comparison of 2-satisfiability algorithms

DOI10.1051/RO/1991250302411MaRDI QIDQ3979516zbMATH OpenOpenAlexFDO

Authors Rossella Petreschi, Bruno Simeone

Publication date 26 June 1992

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105013

zbMATH Keywords

2-SATISFIABILITYalgorithmstest problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 2090009
• Probabilistic performance of a heurisic for the satisfiability problem
• scientific article; zbMATH DE number 956865
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem

Cited in

(7)

• A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
• Network flow and 2-satisfiability
• On-line 2-satisfiability
• 2-satisfiability and diagnosing fault processors in massively parallel computing systems
• SatEx: A web-based framework for SAT experimentation
• The unreasonable effectiveness of alternation-based satisfiabiity algorithms
• Simplifying binary propositional theories into connected components twice as fast

This page was built for publication: Experimental comparison of 2-satisfiability algorithms

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