On the complexity of interactive proofs with bounded communication (Q293359)

From MaRDI portal
Revision as of 03:38, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of interactive proofs with bounded communication
scientific article

    Statements

    title
    On the complexity of interactive proofs with bounded communication (English)
    0 references
    author
    Oded Goldreich
    0 references
    Johan T. Håstad
    0 references
    publication date
    9 June 2016
    0 references
    zbMATH DE Number
    6590750
    0 references
    zbMATH Keywords
    computational complexicity
    0 references
    Wikidata QID
    Q56959078
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q293359&oldid=36255020"
    Powered by MediaWiki