( en | de | ru )

 

Disambiguation of "Limaye, Nutan"

Author of the publication

copydeleteadd this publication to your clipboard
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.

, , and . Commun. ACM, 67 (2): 101-108 (February 2024)

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.

Sarang Limaye

Nutan Sampat

Sarang Suhas Limaye

 

Other publications of authors with the same name

Longest paths in Planar DAGs in Unambiguous Logspace, , and . CoRR, (2008)Longest Paths in Planar DAGs in Unambiguous Log-Space., , and . Chic. J. Theor. Comput. Sci., (2010)Variants of the Determinant polynomial and VP-completeness., , and . Electron. Colloquium Comput. Complex., (2020)A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates., , , , and . Algorithmica, 84 (4): 1132-1162 (2022)Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits., , and . Commun. ACM, 67 (2): 101-108 (February 2024)Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees., , and . Comput. Complex., 28 (3): 471-542 (2019)Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes., , and . ACM Trans. Comput. Theory, 13 (4): 21:1-21:26 (2021)Evaluating Monotone Circuits on Cylinders, Planes and Tori., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 660-671. Springer, (2006)On the VNP-Hardness of Some Monomial Symmetric Polynomials., , and . FSTTCS, volume 250 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees., , and . MFCS, volume 83 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)