On the complexity of interactive proofs with bounded communication (Q293359)
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: On the complexity of interactive proofs with bounded communication |
scientific article; zbMATH DE number 6590750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of interactive proofs with bounded communication |
scientific article; zbMATH DE number 6590750 |
Statements
On the complexity of interactive proofs with bounded communication (English)
0 references
9 June 2016
0 references
computational complexicity
0 references
0 references
0.9432784
0 references
0.9014633
0 references
0.8985446
0 references
0 references
0.8967453
0 references
0.8966838
0 references
