Tighter MA/1 circuit lower bounds from verifier efficient PCPs for PSPACE

DOI10.4230/LIPICS.APPROX/RANDOM.2023.55MaRDI QIDQ6663074zbMATH OpenFDO

Authors Joshua Cook, Dana Moshkovitz

Publication date 14 January 2025

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

zbMATH Keywords

circuit complexityMAaPCP

Mathematics Subject Classification ID

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

This page was built for publication: Tighter MA/1 circuit lower bounds from verifier efficient \(\mathbf{PCP}\)s for \(\mathbf{PSPACE}\)

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