On the complexity of interactive proofs with bounded communication (Q293359): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56959078, #quickstatements; #temporary_batch_1706287054262 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:09, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of interactive proofs with bounded communication |
scientific article |
Statements
On the complexity of interactive proofs with bounded communication (English)
0 references
9 June 2016
0 references
computational complexicity
0 references
