Author of the publication

Pebbles and Branching Programs for Tree Evaluation.

, , , , and . Logic, Automata, and Computational Complexity, volume 43 of ACM Books, ACM, (2023)

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

Why are Proof Complexity Lower Bounds Hard?, and . FOCS, page 1305-1324. IEEE Computer Society, (2019)The Complexity of Explicit Constructions.. CiE, volume 6158 of Lecture Notes in Computer Science, page 372-375. Springer, (2010)Robust simulations and significant separations., and . Inf. Comput., (2017)Pebbles and Branching Programs for Tree Evaluation., , , , and . TOCT, 3 (2): 4:1-4:43 (2012)Hardness Magnification Near State-of-the-Art Lower Bounds., , and . Theory Comput., (2021)Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)., , , , and . Dagstuhl Reports, 13 (3): 17-31 (March 2023)Graph model selection using maximum likelihood, , and . ICML '06: Proceedings of the 23rd international conference on Machine learning, page 105--112. New York, NY, USA, ACM, (2006)Beyond Natural Proofs: Hardness Magnification and Locality., , , , , and . J. ACM, 69 (4): 25:1-25:49 (2022)Time Hierarchies: A Survey., and . Electron. Colloquium Comput. Complex., (2007)Hierarchies Against Sublinear Advice., and . Electron. Colloquium Comput. Complex., (2014)