Parameterized Complexity of DPLL Search Procedures (Q5892172)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6483208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of DPLL Search Procedures |
scientific article; zbMATH DE number 6483208 |
Statements
Parameterized Complexity of DPLL Search Procedures (English)
0 references
17 September 2015
0 references
proof complexity
0 references
parameterized complexity
0 references
prover-delayer games
0 references
resolution
0 references
1.0000001
0 references
0.8881509
0 references
0.8826675
0 references
0.8760789
0 references
0.87174547
0 references
