( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.

, , , и . STOC, стр. 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.

Chandan Maity

Chandan Mukherjee

Chandan Roy

Chandan Das

Chandan Goswami

 

Другие публикации лиц с тем же именем

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