Shorter arithmetization of nondeterministic computations (Q496013)
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 6482886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shorter arithmetization of nondeterministic computations |
scientific article; zbMATH DE number 6482886 |
Statements
Shorter arithmetization of nondeterministic computations (English)
0 references
16 September 2015
0 references
arithmetization
0 references
probabilistically-checkable proofs
0 references
polylogarithmic-time verifier
0 references
0 references
0.8246472477912903
0 references
0.8186542987823486
0 references
0.814434826374054
0 references
0.8110828399658203
0 references
0.790287435054779
0 references
