Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997)
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 7765167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterated lower bound formulas: a diagonalization-based approach to proof complexity |
scientific article; zbMATH DE number 7765167 |
Statements
Iterated lower bound formulas: a diagonalization-based approach to proof complexity (English)
0 references
14 November 2023
0 references
ideal proof system
0 references
algebraic complexity
0 references
circuit complexity lower bounds
0 references
diagonalization
0 references
iterated lower bound formulas
0 references
proof complexity lower bounds
0 references
0.8899739
0 references
0 references
0.8793274
0 references
0.8747516
0 references
0.8734529
0 references
0.87158036
0 references
0.8712112
0 references
