Proof complexity lower bounds from algebraic circuit complexity (Q5368766)
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 6789297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof complexity lower bounds from algebraic circuit complexity |
scientific article; zbMATH DE number 6789297 |
Statements
10 October 2017
0 references
proof complexity
0 references
algebraic complexity
0 references
Nullstellensatz
0 references
subset-sum
0 references
0.8268073201179504
0 references
0.7914456725120544
0 references
0.774493932723999
0 references
0.7716552019119263
0 references
0.7671099901199341
0 references
