Go to the corresponding LIPIcs Volume Portal 
Belovs, Aleksandrs ; Ivanyos, GĂˇbor ; Qiao, Youming ; Santha, Miklos ; Yang, Siyi
pdfformat: 

@InProceedings{belovs_et_al:LIPIcs:2017:7526, author = {Aleksandrs Belovs and G{\'a}bor Ivanyos and Youming Qiao and Miklos Santha and Siyi Yang}, title = {{On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz}}, booktitle = {32nd Computational Complexity Conference (CCC 2017)}, pages = {30:130:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770408}, ISSN = {18688969}, year = {2017}, volume = {79}, editor = {Ryan O'Donnell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7526}, URN = {urn:nbn:de:0030drops75260}, doi = {10.4230/LIPIcs.CCC.2017.30}, annote = {Keywords: ChevalleyWarning Theorem, Combinatorail Nullstellensatz, Polynomial Parity Argument, arithmetic circuit} }
Keywords:  ChevalleyWarning Theorem, Combinatorail Nullstellensatz, Polynomial Parity Argument, arithmetic circuit  
Collection:  32nd Computational Complexity Conference (CCC 2017)  
Issue Date:  2017  
Date of publication:  01.08.2017 