PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Harsha, Prahladh"

Author of the publication

copydeleteadd this publication to your clipboard
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding.

, , , , and . SIAM J. Comput., 36 (4): 889-974 (2006)

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.

No persons found for author name Harsha, Prahladh
add a person with the name Harsha, Prahladh
 

Other publications of authors with the same name

On polynomial approximations over ℤ/2kℤ., , and . Electronic Colloquium on Computational Complexity (ECCC), (2017)Sound 3-query PCPPs are Long., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2007)List Decoding with Double Samplers., , , , and . SODA, page 2134-2153. SIAM, (2019)On Multilinear Forms: Bias, Correlation, and Tensor Rank., , , , and . CoRR, (2018)A Characterization of hard-to-cover CSPs., , and . CoRR, (2014)Sound 3-Query PCPPs Are Long., , , and . TOCT, 1 (2): 7:1-7:49 (2009)Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1., , and . FSTTCS, volume 65 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Composition of Low-Error 2-Query PCPs Using Decodable PCPs., and . FOCS, page 472-481. IEEE Computer Society, (2009)A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound., and . FSTTCS, volume 24 of LIPIcs, page 141-152. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2013)Almost settling the hardness of noncommutative determinant., , , and . STOC, page 499-508. ACM, (2011)