Circuit complexity, proof complexity, and polynomial identity testing. The ideal proof system (Q4625658)
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 7029222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circuit complexity, proof complexity, and polynomial identity testing. The ideal proof system |
scientific article; zbMATH DE number 7029222 |
Statements
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing (English)
0 references
25 February 2019
0 references
\(\mathrm{AC}^0[p]\)-Frege
0 references
VNP
0 references
lower bounds
0 references
permanent
0 references
determinant
0 references
polynomial calculus
0 references
polynomial identity testing
0 references
syzygies
0 references
0.8268073201179504
0 references
0.8093772530555725
0 references
0.7849152684211731
0 references
0.7770049571990967
0 references
0.7681211829185486
0 references
