Unprovability of strong complexity lower bounds in bounded arithmetic (Q6499282)
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: Unprovability of strong complexity lower bounds in bounded arithmetic |
scientific article; zbMATH DE number 7844652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unprovability of strong complexity lower bounds in bounded arithmetic |
scientific article; zbMATH DE number 7844652 |
Statements
Unprovability of strong complexity lower bounds in bounded arithmetic (English)
0 references
8 May 2024
0 references
bounded arithmetic
0 references
circuit complexity
0 references
lower bounds
0 references
unprovability
0 references
0 references
0 references
0 references
0 references
