Pebble games, proof complexity, and time-space trade-offs (Q2848360)
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: Pebble games, proof complexity, and time-space trade-offs |
scientific article; zbMATH DE number 6211834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pebble games, proof complexity, and time-space trade-offs |
scientific article; zbMATH DE number 6211834 |
Statements
26 September 2013
0 references
proof complexity
0 references
resolution
0 references
\(k\)-DNF resolution
0 references
polynomial calculus
0 references
PCR
0 references
cutting planes
0 references
separation
0 references
pebble games
0 references
pebbling formulas
0 references
SAT solving
0 references
DPLL
0 references
CDCL
0 references
survey paper
0 references
size-space trade-offs
0 references
proof space
0 references
proof size
0 references
Pebble games, proof complexity, and time-space trade-offs (English)
0 references
0.8750010132789612
0 references
0.8089019656181335
0 references
0.7929480671882629
0 references
0.766916036605835
0 references
