Author of the publication

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)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)Hardness Magnification Near State-of-the-Art Lower Bounds., , and . Theory Comput., (2021)Pseudodeterministic Constructions in Subexponential Time., and . Electron. Colloquium Comput. Complex., (2016)Beyond Natural Proofs: Hardness Magnification and Locality., , , , , and . J. ACM, 69 (4): 25:1-25:49 (2022)Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity., and . SODA, page 231-241. SIAM, (2015)Errorless Versus Error-Prone Average-Case Complexity., and . ITCS, volume 215 of LIPIcs, page 84:1-84:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Relativization Perspective on Meta-Complexity., and . STACS, volume 219 of LIPIcs, page 54:1-54:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pseudodeterministic algorithms and the structure of probabilistic time., , and . STOC, page 303-316. ACM, (2021)On Medium-Uniformity and Circuit Lower Bounds., and . CCC, page 15-23. IEEE Computer Society, (2013)