Author of the publication

Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines.

, and . Electron. Colloquium Comput. Complex., (2020)

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

Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines., and . Electron. Colloquium Comput. Complex., (2020)Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning., , , , and . ITCS, volume 287 of LIPIcs, page 25:1-25:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines., and . ITCS, volume 185 of LIPIcs, page 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Parallel repetition for all 3-player games over binary alphabet., , , , and . STOC, page 998-1009. ACM, (2022)Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning., , , , and . CoRR, (2023)Parallel Repetition for the GHZ Game: A Simpler Proof., , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 62:1-62:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof., , , , and . Electron. Colloquium Comput. Complex., (2021)