Author of the publication

Regularization of Low Error PCPs and an Application to MCSP.

, and . ISAAC, volume 283 of LIPIcs, page 39:1-39:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

NP-hardness of approximately solving linear equations over reals., and . STOC, page 413-420. ACM, (2011)Regularization of Low Error PCPs and an Application to MCSP., and . ISAAC, volume 283 of LIPIcs, page 39:1-39:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Improved Approximation Algorithms for Projection Games - (Extended Abstract)., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)Reduction from Non-Unique Games to Boolean Unique Games., and . ITCS, volume 215 of LIPIcs, page 64:1-64:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Nearly Optimal Pseudorandomness From Hardness., , , and . FOCS, page 1057-1068. IEEE, (2020)Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE., and . APPROX/RANDOM, volume 275 of LIPIcs, page 55:1-55:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Mixing Implies Lower Bounds for Space Bounded Learning., and . COLT, volume 65 of Proceedings of Machine Learning Research, page 1516-1566. PMLR, (2017)Sub-constant error low degree test of almost-linear size., and . STOC, page 21-30. ACM, (2006)Amplification and Derandomization without Slowdown., and . FOCS, page 770-779. IEEE Computer Society, (2016)Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning., and . ITCS, volume 94 of LIPIcs, page 28:1-28:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)