Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

Recommendations

Probabilistic performance of a heurisic 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 4102824
The probabilistic analysis of a greedy satisfiability algorithm
An exact and a randomized approach for the satisfiability problem

Cited in

(39)

The scaling window of the 2-SAT transition
Super solutions of random $(3 + p)$-SAT
A sharp threshold for a random constraint satisfaction problem
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Typical case complexity of satisfiability algorithms and the threshold phenomenon
On good algorithms for determining unsatisfiability of propositional formulas
Solving non-uniform planted and filtered random SAT formulas greedily
Solution clustering in random satisfiability
Sharp thresholds of graph properties, and the $k$-sat problem
Probabilistic bounds and algorithms for the maximum satisfiability problem
Random $k$-SAT and the power of two choices
Upper bounds on the satisfiability threshold
Probabilistic performance of a heurisic for the satisfiability problem
Application of soil-structure interaction to off-shore foundations with specific reference to consolidation analysis
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
An efficient algorithm for the 3-satisfiability problem
A threshold for unsatisfiability
An algorithm for random signed 3-SAT with intervals
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
Rigorous results for random ($2+p)$-SAT
Results related to threshold phenomena research in satisfiability: Lower bounds
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
The cook-book approach to the differential equation method
Biased random k‐SAT
On the thresholds in linear and nonlinear Boolean equations
scientific article; zbMATH DE number 4102824 (Why is no real title available?)
Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Phase transition in a random NK landscape model
Lower bounds for random 3-SAT via differential equations
Random 2-SAT: Results and problems
Phase transitions of PP-complete satisfiability problems
Exact satisfiability, a natural extension of set partition, and its average case behavior
An average case analysis of a resolution principle algorithm in mechanical theorem proving.
On Random 3-sat
An exact and a randomized approach for the satisfiability problem
Statistical physics analysis of the backtrack resolution of random 3-SAT instances
Selecting Complementary Pairs of Literals
Belief propagation on the random $k$-SAT model

This page was built for publication: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

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