( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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)On the Existence of Algebraically Natural Proofs., , , , и . FOCS, стр. 870-880. IEEE, (2020)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)Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees., и . CoRR, (2017)Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order., , и . Electron. Colloquium Comput. Complex., (2013)Derandomization from Algebraic Hardness: Treading the Borders., , и . Electron. Colloquium Comput. Complex., (2019)If VNP is hard, then so are equations for it., , , и . CoRR, (2020)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , и . CCC, том 50 из LIPIcs, стр. 30:1-30:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Arithmetic Circuits: A Chasm at Depth 3., , , и . SIAM J. Comput., 45 (3): 1064-1079 (2016)