( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.

, , , и . STOC, стр. 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.

Manohar Awasthi

Manohar Patil

Rampurkar Manohar

Manohar Patil

Manohar Lal Madan

 

Другие публикации лиц с тем же именем

Succinct Arguments in the Quantum Random Oracle Model., , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 1-29. Springer, (2019)Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random., , и . STOC, стр. 678-689. ACM, (2022)On Local Testability in the Non-Signaling Setting., , и . ITCS, том 151 из LIPIcs, стр. 26:1-26:37. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Local Testability in the Non-Signaling Setting., , и . Electron. Colloquium Comput. Complex., (2019)Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally., , и . ALT, том 167 из Proceedings of Machine Learning Research, стр. 638-667. PMLR, (2022)Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number., , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 42:1-42:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Testing Linearity against Non-signaling Strategies., , и . 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., , , и . STOC, стр. 1438-1448. ACM, (2023)An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes., и . STOC, стр. 776-787. ACM, (2024)Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing., , и . ITCS, том 124 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)