Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICALP
2004
Springer

favoriteEmaildiscussreport

91views Programming Languages» more ICALP 2004»

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

13 years 10 months ago

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Download publications.ias.edu

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsy

Real-time Traffic

ICALP 2004 | Theoretical Computer Science |

claim paper

Related Content

» Efficient SAT solving for nonclausal formulas using DPLL graphs and watched cuts

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know i...

» Parameterized Modal Satisfiability

» Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems

» MaxSolver An efficient exact algorithm for weighted maximum satisfiability

» Algorithmic Metatheorems for Restrictions of Treewidth

» Automatic Processor Lower Bound Formulas for Array Computations

» kmeans requires exponentially many iterations even in the plane

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICALP
Authors	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson

Comments (0)