Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Tal Skverer:

TR22-124 | 9th September 2022
Oded Goldreich, Guy Rothblum, Tal Skverer

On Interactive Proofs of Proximity with Proof-Oblivious Queries

Revisions: 2

Interactive proofs of proximity (IPPs) offer ultra-fast
approximate verification of assertions regarding their input,
where ultra-fast means that only a small portion of the input is read
and approximate verification is analogous to the notion of
approximate decision that underlies property testing.
Specifically, in an IPP, the prover can make ... more >>>

ISSN 1433-8092 | Imprint