On the complexity of choosing the branching literal in DPLL (Q1978252): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0004-3702(99)00097-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057832617 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 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
