Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation (Q5368736)
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 6789267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation |
scientific article; zbMATH DE number 6789267 |
Statements
10 October 2017
0 references
counting complexity
0 references
exponential-time hypothesis
0 references
interactive proofs
0 references
Merlin-Arthur games
0 references
0.7533385753631592
0 references
0.7484765648841858
0 references
0.7398989796638489
0 references
0.728986382484436
0 references
