On the complexity of choosing the branching literal in DPLL (Q1978252): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of choosing the branching literal in DPLL |
scientific article |
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
