( en | de | ru )

 

Disambiguation of "Kayal, Neeraj"

Author of the publication

copydeleteadd this publication to your clipboard
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.

, , , and . SIAM J. Comput., 46 (1): 307-335 (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. 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

Random Arithmetic Formulas Can Be Reconstructed Efficiently., , and . CCC, page 1-9. IEEE Computer Society, (2013)A super-polynomial lower bound for regular arithmetic formulas., , and . STOC, page 146-153. ACM, (2014)On the Sum of Square Roots of Polynomials and Related Problems., and . CCC, page 292-299. IEEE Computer Society, (2011)Reconstruction of non-degenerate homogeneous depth three circuits., and . STOC, page 413-424. ACM, (2019)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)Polynomial Identity Testing for Depth 3 Circuits, and . Electron. Colloquium Comput. Complex., (2005)An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas., , , and . FOCS, page 61-70. IEEE Computer Society, (2014)Efficient Reconstruction of Random Multilinear Formulas., , and . FOCS, page 778-787. IEEE Computer Society, (2011)Arithmetic Circuit Complexity (Tutorial).. STACS, volume 25 of LIPIcs, page 28-28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)