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: 25th Annual European Symposium on Algorithms (ESA 2017) Leibniz International Proceedings in Informatics (LIPIcs) (87) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 59:1-59:15. ISSN 1868-8969
Subexponential parameterized algorithms for graphs of polynomial growth