Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang. On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. In Ryan O'Donnell, editor, 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. Volume 79 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{BelovsIQSY17,
title = {On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz},
author = {Aleksandrs Belovs and Gábor Ivanyos and Youming Qiao and Miklos Santha and Siyi Yang},
year = {2017},
doi = {10.4230/LIPIcs.CCC.2017.30},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.30},
researchr = {https://researchr.org/publication/BelovsIQSY17},
cites = {0},
citedby = {0},
booktitle = {32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia},
editor = {Ryan O'Donnell},
volume = {79},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-040-8},
}