( en | de | ru )

 

Disambiguation of "Saha, Chandan"

Author of the publication

copydeleteadd this publication to your clipboard
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.

, , , and . STOC, page 599-614. ACM, (2012)

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.

Chandan Maity

Chandan Mukherjee

Chandan Roy

Chandan Goswami

Chandan Das

 

Other publications of authors with the same name

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)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)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)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)Quasi-polynomial Hitting-set for Set-depth-Delta Formulas, , and . CoRR, (2012)Quasi-polynomial hitting-set for set-depth-Δ formulas., , and . STOC, page 321-330. ACM, (2013)An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas., , , and . SIAM J. Comput., 46 (1): 307-335 (2017)Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas., , , and . STOC, page 119-127. ACM, (2014)Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)