Author of the publication

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

The Power of Depth 2 Circuits over Algebras., , and . FSTTCS, volume 4 of LIPIcs, page 371-382. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Equivalence Test for Read-Once Arithmetic Formulas., , and . SODA, page 4205-4272. SIAM, (2023)A super-polynomial lower bound for regular arithmetic formulas., , and . STOC, page 146-153. ACM, (2014)NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials., , , and . ICALP, volume 297 of LIPIcs, page 16:1-16:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests., , and . MFCS, volume 170 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fast integer multiplication using modular arithmetic., , , and . STOC, page 499-506. ACM, (2008)Multi-k-ic Depth Three Circuit Lower Bound., and . STACS, volume 30 of LIPIcs, page 527-539. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits., , , and . SIAM J. Comput., 45 (4): 1533-1562 (2016)On the Symmetries of and Equivalence Test for Design Polynomials., and . MFCS, volume 138 of LIPIcs, page 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quasi-polynomial Hitting-set for Set-depth-Delta Formulas, , and . CoRR, (2012)