scientific article; zbMATH DE number 6829278
From MaRDI portal
Publication:4601830
DOI10.4230/LIPIcs.CCC.2015.217zbMath1388.68061MaRDI QIDQ4601830
Amit Chakrabarti, Justin Thaler, Suresh Venkatasubramanian, Andrew McGregor, Graham Cormode
Publication date: 24 January 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ The landscape of communication complexity classes ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Unnamed Item ⋮ On the Power of Statistical Zero Knowledge ⋮ Unnamed Item ⋮ Proofs of Proximity for Distribution Testing ⋮ An Exponential Separation Between MA and AM Proofs of Proximity ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Non-interactive proofs of proximity ⋮ The complexity of quantum disjointness
This page was built for publication:
