Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas |
scientific article; zbMATH DE number 5118122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas |
scientific article; zbMATH DE number 5118122 |
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
0.9926490783691406
0 references
0.902643084526062
0 references
0.8768424391746521
0 references
0.8630138039588928
0 references
0.8611270189285278
0 references
