On the complexity of interactive proofs with bounded communication (Q293359)
From MaRDI portal
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
