( en | de | ru )

 

Disambiguation of "Kayal, Neeraj"

Author of the publication

copydeleteadd this publication to your clipboard
Learning generalized depth-three arithmetic circuits in the non-degenerate case.

, , , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Abdullah Kayal

Neeraj Tiwari

Neeraj Mishra

Hakan Kayal

Hafez Kayali

 

Other publications of authors with the same name

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