Author of the publication

Hitting sets for multilinear read-once algebraic branching programs, in any order.

, , and . STOC, page 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. 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

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)Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem., , and . Eur. J. Oper. Res., 318 (3): 836-850 (2024)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , and . ACM Trans. Comput. Theory, 10 (1): 3:1-3:30 (2018)Polynomial identity testing of read-once oblivious algebraic branching programs.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2014)ndltd.org (oai:dspace.mit.edu:1721.1/89843).Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals., and . STOC, page 389-402. ACM, (2022)On identity testing of tensors, low-rank recovery and compressed sensing., and . STOC, page 163-172. ACM, (2012)Low-Depth Algebraic Circuit Lower Bounds over Any Field.. CCC, volume 300 of LIPIcs, page 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , and . Electron. Colloquium Comput. Complex., (2017)