On the complexity of interactive proofs with bounded communication (Q293359): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Oded Goldreich / rank
Normal rank
 
Property / author
 
Property / author: Johan T. Håstad / rank
Normal rank
 

Revision as of 09:40, 10 February 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
    0 references
    9 June 2016
    0 references
    0 references
    computational complexicity
    0 references
    0 references