Author of the publication

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)

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

Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs., , , , and . CoRR, (2015)Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem., and . Eur. J. Oper. Res., 270 (1): 78-88 (2018)Hitting sets for multilinear read-once algebraic branching programs, in any order., , and . STOC, page 867-875. ACM, (2014)Deterministic Divisibility Testing via Shifted Partial Derivatives.. FOCS, page 451-465. IEEE Computer Society, (2015)Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs., and . FOCS, page 243-252. IEEE Computer Society, (2013)Logic-based benders decomposition for wildfire suppression., , and . Comput. Oper. Res., (December 2023)Disaggregated benders decomposition for solving a network maintenance scheduling problem., and . J. Oper. Res. Soc., 70 (6): 941-953 (2019)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , and . CoRR, (2017)Proof Complexity Lower Bounds from Algebraic Circuit Complexity., , , and . CCC, volume 50 of LIPIcs, page 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Blackbox Identity Testing of Log-Variate Circuits., , and . ICALP, volume 107 of LIPIcs, page 54:1-54:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)