@InProceedings{cook_et_al:LIPIcs.APPROX/RANDOM.2023.55,
author = {Cook, Joshua and Moshkovitz, Dana},
title = {{Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {55:1--55:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.55},
URN = {urn:nbn:de:0030-drops-188805},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.55},
annote = {Keywords: MA, PCP, Circuit Complexity}
}