Efficient interactive proofs for non-deterministic bounded space

DOI10.4230/LIPICS.APPROX/RANDOM.2023.47MaRDI QIDQ6663064zbMATH OpenFDO

Authors Joshua Cook, Ron D. Rothblum

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.47

zbMATH Keywords

AC0[2]alternating algorithmsdoubly efficient proofsinteractive proofs

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(1)

• Space-bounded quantum interactive proof systems

This page was built for publication: Efficient interactive proofs for non-deterministic bounded space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663064)