Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE

Joshua Cook, Dana Moshkovitz. Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Joshua Cook

This author has not been identified. Look up 'Joshua Cook' in Google

Dana Moshkovitz

This author has not been identified. Look up 'Dana Moshkovitz' in Google