Randomized Algorithms for 3-SAT

15 years 2 months ago

Download www.uni-ulm.de

In [Sch99], Sch¨oning proposed a simple yet eﬃcient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) · (4/3)n

Thomas Hofmeister, Uwe Schöning, Rainer Schul

Real-time Traffic

Expected Running Time | Eﬃcient Randomized Algorithm | K-SAT Problem | MST 2007 |

claim paper

» Observed Lower Bounds for Random 3SAT Phase Transition Density Using Linear Programming

» Random 3SAT and BDDs The Plot Thickens Further

» Typical random 3SAT formulae and the satisfiability threshold

» Random 3SAT The Plot Thickens

» On the Hardness and Easiness of Random 4SAT Formulas

» Heuristics for Fast Exact Model Counting

» Understanding Random SAT Beyond the ClausestoVariables Ratio

» Notions of AverageCase Complexity for Random 3SAT

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MST
Authors	Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe

Comments (0)

Sciweavers

Randomized Algorithms for 3-SAT

Expected Running Time | Eﬃcient Randomized Algorithm | K-SAT Problem | MST 2007 |

Explore & Download

Productivity Tools

Sciweavers