On the complexity of choosing the branching literal in DPLL (Q1978252)
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: On the complexity of choosing the branching literal in DPLL |
scientific article; zbMATH DE number 1454128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of choosing the branching literal in DPLL |
scientific article; zbMATH DE number 1454128 |
Statements
On the complexity of choosing the branching literal in DPLL (English)
0 references
4 June 2000
0 references
Davis-Putnam
0 references
complexity
0 references
propositional satisfiability
0 references
0.9085412621498108
0 references
0.8406407833099365
0 references
0.7884296178817749
0 references
0.7843316793441772
0 references
0.7824239730834961
0 references
