( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Partial Derivatives in Arithmetic Complexity and Beyond.

, , и . Foundations and Trends in Theoretical Computer Science, 6 (1-2): 1-138 (2011)

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.

Abdullah Kayal

Neeraj Tiwari

Neeraj Mishra

Hakan Kayal

Hafez Kayali

 

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

Approaching the Chasm at Depth Four., , , и . J. ACM, 61 (6): 33:1-33:16 (2014)Reconstruction of Full Rank Algebraic Branching Programs., , , и . TOCT, 11 (1): 2:1-2:56 (2019)Reconstruction of non-degenerate homogeneous depth three circuits., и . STOC, стр. 413-424. ACM, (2019)A super-polynomial lower bound for regular arithmetic formulas., , и . Electron. Colloquium Comput. Complex., (2013)Determinant equivalence test over finite fields and over ℚ., , , и . Electron. Colloquium Comput. Complex., (2019)Polynomial Identity Testing for Depth 3 Circuits, и . Electron. Colloquium Comput. Complex., (2005)Factoring groups efficiently., и . Electron. Colloquium Comput. Complex., (2008)Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits., , и . STACS, том 47 из LIPIcs, стр. 46:1-46:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Random arithmetic formulas can be reconstructed efficiently., , и . Comput. Complex., 23 (2): 207-303 (2014)Partial Derivatives in Arithmetic Complexity and Beyond., , и . Foundations and Trends in Theoretical Computer Science, 6 (1-2): 1-138 (2011)