Sciweavers

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

30

ICALP
2004
Springer

favoriteEmaildiscussreport

91views Programming Languages» more ICALP 2004»

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

14 years 5 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

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)