@InProceedings{belovs_et_al:LIPIcs.CCC.2017.30,
author = {Belovs, Aleksandrs and Ivanyos, G\'{a}bor and Qiao, Youming and Santha, Miklos and Yang, Siyi},
title = {{On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz}},
booktitle = {32nd Computational Complexity Conference (CCC 2017)},
pages = {30:1--30:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-040-8},
ISSN = {1868-8969},
year = {2017},
volume = {79},
editor = {O'Donnell, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.30},
URN = {urn:nbn:de:0030-drops-75260},
doi = {10.4230/LIPIcs.CCC.2017.30},
annote = {Keywords: Chevalley-Warning Theorem, Combinatorail Nullstellensatz, Polynomial Parity Argument, arithmetic circuit}
}