( en | de | ru )

 

Disambiguation of "Saptharishi, Ramprasad"

Author of the publication

copydeleteadd this publication to your clipboard
Derandomization from Algebraic Hardness: Treading the Borders.

, , , and . FOCS, page 147-157. IEEE Computer Society, (2019)

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

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits., , , and . STOC, page 599-614. ACM, (2012)An exponential lower bound for homogeneous depth-5 circuits over finite fields., and . Electron. Colloquium Comput. Complex., (2015)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , and . ACM Trans. Comput. Theory, 10 (1): 3:1-3:30 (2018)On the Existence of Algebraically Natural Proofs., , , , and . FOCS, page 870-880. IEEE, (2020)Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees., and . CoRR, (2017)If VNP is hard, then so are equations for it., , , and . CoRR, (2020)Derandomization from Algebraic Hardness: Treading the Borders., , and . Electron. Colloquium Comput. Complex., (2019)Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order., , and . Electron. Colloquium Comput. Complex., (2013)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , and . CCC, volume 50 of LIPIcs, page 30:1-30:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Arithmetic Circuits: A Chasm at Depth 3., , , and . SIAM J. Comput., 45 (3): 1064-1079 (2016)