( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Non-FPT Lower Bounds for Some Arithmetic Formulas.

, , и . Electron. Colloquium Comput. Complex., (2021)

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.

Sarang Limaye

Nutan Sampat

Sarang Suhas Limaye

 

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

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