( en | de | ru )

 

Disambiguierung von "Saptharishi, Ramprasad"

From post

копироватьудалитьдобавить публикацию в буфер
Hitting sets for multilinear read-once algebraic branching programs, in any order.

, , и . STOC, стр. 867-875. ACM, (2014)

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.

No persons found for author name Saptharishi, Ramprasad
add a person with the name Saptharishi, Ramprasad
 

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

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits., , , и . STOC, стр. 599-614. ACM, (2012)An exponential lower bound for homogeneous depth-5 circuits over finite fields., и . Electron. Colloquium Comput. Complex., (2015)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , и . ACM Trans. Comput. Theory, 10 (1): 3:1-3:30 (2018)On the Existence of Algebraically Natural Proofs., , , , и . FOCS, стр. 870-880. IEEE, (2020)Arithmetic Circuits: A Chasm at Depth 3., , , и . SIAM J. Comput., 45 (3): 1064-1079 (2016)Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits., , , и . CoRR, (2024)Towards Optimal Depth Reductions for Syntactically Multilinear Circuits., , и . ICALP, том 132 из LIPIcs, стр. 78:1-78:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Hitting sets for multilinear read-once algebraic branching programs, in any order., , и . STOC, стр. 867-875. ACM, (2014)An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields., и . CCC, том 79 из LIPIcs, стр. 31:1-31:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Derandomization from Algebraic Hardness: Treading the Borders., , , и . FOCS, стр. 147-157. IEEE Computer Society, (2019)