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

Cobham recursive set functions., , , , and . Ann. Pure Appl. Logic, 167 (3): 335-369 (2016)Propositional Proofs in Frege and Extended Frege Systems (Abstract).. CSR, volume 9139 of Lecture Notes in Computer Science, page 1-6. Springer, (2015)Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs., , and . CSL, volume 152 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Expander Construction in VNC1., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2016)Unshuffling a Square is NP-Hard., and . CoRR, (2012)Feasible set functions have small circuits., , , , and . Computability, 8 (1): 67-98 (2019)The NP Search Problems of Frege and Extended Frege Proofs., and . ACM Trans. Comput. Log., 18 (2): 11:1-11:19 (2017)Computability in Europe 2011., , , and . Ann. Pure Appl. Logic, 164 (5): 509-510 (2013)Strong isomorphism reductions in complexity theory., , , , and . J. Symb. Log., 76 (4): 1381-1402 (2011)Short refutations for an equivalence-chain principle for constant-depth formulas., and . Math. Log. Q., 64 (6): 505-513 (2018)