Author of the publication

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.

 

Other publications of authors with the same name

Longest paths in Planar DAGs in Unambiguous Logspace, , and . CoRR, (2008)Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees., , and . Comput. Complex., 28 (3): 471-542 (2019)Longest Paths in Planar DAGs in Unambiguous Log-Space., , and . Chic. J. Theor. Comput. Sci., (2010)Evaluating Monotone Circuits on Cylinders, Planes and Tori., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 660-671. Springer, (2006)Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees., , and . MFCS, volume 83 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates., , , , and . ITCS, volume 124 of LIPIcs, page 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the VNP-Hardness of Some Monomial Symmetric Polynomials., , and . FSTTCS, volume 250 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do?, , , , and . CoRR, (2024)Upper Bounds for Monotone Planar Circuit Value and Variants., , and . Comput. Complex., 18 (3): 377-412 (2009)Streaming algorithms for language recognition problems., , , and . Theor. Comput. Sci., (2013)