Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (Q2941756)
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 6475344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic |
scientific article; zbMATH DE number 6475344 |
Statements
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (English)
0 references
25 August 2015
0 references
bounded arithmetic
0 references
complexity theory
0 references
formalizations
0 references
0.7470837831497192
0 references
0.7470837831497192
0 references
0.7358381152153015
0 references
