PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Saptharishi, Ramprasad"

Author of the publication

copydeleteadd this publication to your clipboard
Efficiently Decoding Reed-Muller Codes From Random Errors.

, , and . IEEE Trans. Information Theory, 63 (4): 1954-1960 (2017)

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 Saptharishi, Ramprasad
add a person with the name Saptharishi, Ramprasad
 

Other publications of authors with the same name

The Chasm at Depth Four, and Tensor Rank : Old results, new insights., , , and . CoRR, (2016)Unexpected power of low-depth arithmetic circuits., , , and . Commun. ACM, 60 (6): 93-100 (2017)Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees., and . FSTTCS, volume 122 of LIPIcs, page 6:1-6:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Finer Separations Between Shallow Arithmetic Circuits., and . FSTTCS, volume 65 of LIPIcs, page 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits., , and . SODA, page 639-646. SIAM, (2019)The Power of Depth 2 Circuits over Algebras., , and . FSTTCS, volume 4 of LIPIcs, page 371-382. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2009)A super-polynomial lower bound for regular arithmetic formulas., , and . STOC, page 146-153. ACM, (2014)Approaching the Chasm at Depth Four., , , and . J. ACM, 61 (6): 33:1-33:16 (2014)A super-polynomial lower bound for regular arithmetic formulas., , and . Electronic Colloquium on Computational Complexity (ECCC), (2013)Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits., , and . CoRR, (2018)