Author of the publication

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs.

, , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2015)

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.

 

Other publications of authors with the same name

Dimension Expanders via Rank Condensers., and . CoRR, (2014)Optimizing Network Designs for the World's Largest Broadband Project., , , , and . Interfaces, 45 (1): 83-97 (2015)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , and . CoRR, (2017)Improved Soundness for QMA with Multiple Provers, and . CoRR, (2011)Towards Blackbox Identity Testing of Log-Variate Circuits., , and . ICALP, volume 107 of LIPIcs, page 54:1-54:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Proof Complexity Lower Bounds from Algebraic Circuit Complexity., , , and . Computational Complexity Conference, volume 50 of LIPIcs, page 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Disaggregated benders decomposition for solving a network maintenance scheduling problem., and . J. Oper. Res. Soc., 70 (6): 941-953 (2019)Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs., and . FOCS, page 243-252. IEEE Computer Society, (2013)Deterministic Divisibility Testing via Shifted Partial Derivatives.. FOCS, page 451-465. IEEE Computer Society, (2015)Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs., , , , and . CoRR, (2015)