External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. In Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, editors, Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Volume 3142 of Lecture Notes in Computer Science, pages 84-96, Springer, 2004. [doi]

Authors

Michael Alekhnovich

This author has not been identified. Look up 'Michael Alekhnovich' in Google

Edward A. Hirsch

This author has not been identified. Look up 'Edward A. Hirsch' in Google

Dmitry Itsykson

This author has not been identified. Look up 'Dmitry Itsykson' in Google
runs on