( en | de | ru )

 

Disambiguation of "Manohar, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.

, , , and . STOC, page 1438-1448. ACM, (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.

Manohar Awasthi

Manohar Patil

Rampurkar Manohar

Manohar Patil

Manohar Lal Madan

 

Other publications of authors with the same name

Succinct Arguments in the Quantum Random Oracle Model., , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 1-29. Springer, (2019)Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random., , and . STOC, page 678-689. ACM, (2022)Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs., and . FOCS, page 1802-1845. IEEE, (2024)New Spectral Algorithms for Refuting Smoothed k-SAT., , and . Commun. ACM, 68 (3): 83-91 (March 2025)On Local Testability in the Non-Signaling Setting., , and . Electron. Colloquium Comput. Complex., (2019)On Local Testability in the Non-Signaling Setting., , and . ITCS, volume 151 of LIPIcs, page 26:1-26:37. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Testing Linearity against Non-signaling Strategies., , and . ACM Trans. Comput. Theory, 12 (3): 16:1-16:51 (2020)A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation., , , and . STOC, page 1438-1448. ACM, (2023)An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes., and . STOC, page 776-787. ACM, (2024)A $k^qq-2$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs., and . Electron. Colloquium Comput. Complex., (2024)