In: 32nd Computational Complexity Conference, CCC 2017 Leibniz International Proceedings in Informatics, LIPIcs (79) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 30:1-30:24. ISSN 1868-8969
On the polynomial parity argument complexity of the combinatorial nullstellensatz
In: 8th Innovations in Theoretical Computer Science Conference, (ITCS) Leibniz International Proceedings in Informatics (LIPIcs) (67) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 55:1-55:19. ISSN 1868-8969
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time
In: 28th European Summer School in Logic, Language and Information, ESSLLI 2016, DSALT: Distributional Semantics and Linguistic Theory, 2016.08.15-2016.08.26, Bolzano.