Probabilistic analysis of satisfiability algorithms

MaRDI QIDQ3081621zbMATH OpenFDO

Authors John V. Franco

Publication date 9 March 2011

zbMATH Keywords

spectral analysisresolutionSATstatistical mechanicsmyopic algorithmsnonmyopic algorithmssatisfiabiliy problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Probabilistic performance of a heurisic for the satisfiability problem
• scientific article; zbMATH DE number 4102824
• An exact and a randomized approach for the satisfiability problem
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
• scientific article; zbMATH DE number 2083805

Cited in

(11)

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• A comparative runtime analysis of heuristic algorithms for satisfiability problems
• Probabilistic satisfiability
• scientific article; zbMATH DE number 2080313 (Why is no real title available?)
• scientific article; zbMATH DE number 1335882 (Why is no real title available?)
• A probabilistic study on the satisfiability problem
• Refinement-oriented probability for CSP
• Probabilistic performance of a heurisic for the satisfiability problem
• Probabilistic approach to the satisfiability problem
• scientific article; zbMATH DE number 3909744 (Why is no real title available?)
• A probabilistic analysis of randomly generated binary constraint satisfaction problems.

This page was built for publication: Probabilistic analysis of satisfiability algorithms

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