An Exponential Separation Between MA and AM Proofs of Proximity

Interactive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational complexity 2021-12, Vol.30 (2), Article 12
Hauptverfasser:	Gur, Tom, Liu, Yang P., Rothblum, Ron D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Complexity Computational Mathematics and Numerical Analysis Computer Science Lower bounds Proximity Quantum computing Quantum phenomena Separation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!