( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Unified Method for Placing Problems in Polylogarithmic Depth.

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

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

 

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

Evaluating Monotone Circuits on Cylinders, Planes and Tori., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 660-671. Springer, (2006)Longest Paths in Planar DAGs in Unambiguous Log-Space., , и . Chic. J. Theor. Comput. Sci., (2010)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 Logspace, , и . CoRR, (2008)Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees., , и . MFCS, том 83 из LIPIcs, стр. 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)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)On the VNP-Hardness of Some Monomial Symmetric Polynomials., , и . FSTTCS, том 250 из LIPIcs, стр. 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications., , и . STACS, том 96 из LIPIcs, стр. 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications., , и . SIAM J. Comput., 48 (1): 70-92 (2019)Efficient Embedding of Functions in Weighted Communication Networks., , и . CoRR, (2014)