Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas |
scientific article |
Statements
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (English)
0 references
24 January 2007
0 references
contemporary algorithms
0 references
propositional satisfiability problem
0 references
