( en | de | ru )

 

Disambiguation of "Saptharishi, Ramprasad"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

An exponential lower bound for homogeneous depth-5 circuits over finite fields., and . Electron. Colloquium Comput. Complex., (2015)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)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)Towards Optimal Depth Reductions for Syntactically Multilinear Circuits., , and . ICALP, volume 132 of LIPIcs, page 78:1-78:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields., and . CCC, volume 79 of LIPIcs, page 31:1-31:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Arithmetic Circuits: A Chasm at Depth 3., , , and . SIAM J. Comput., 45 (3): 1064-1079 (2016)Hitting sets for multilinear read-once algebraic branching programs, in any order., , and . STOC, page 867-875. ACM, (2014)Derandomization from Algebraic Hardness: Treading the Borders., , , and . FOCS, page 147-157. IEEE Computer Society, (2019)Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits., , , and . Electron. Colloquium Comput. Complex., (2024)