by Alexandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha and Siyi Yang
Reference:
On the Polynomial Parity Argument complexity of the Combinatorial Nullstellensatz (Alexandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha and Siyi Yang), In , 2017.
Bibtex Entry:
@inproceedings{conf/coco/BelovsIQSY17,
Author = {Alexandrs Belovs and Gábor Ivanyos and Youming Qiao and Miklos Santha and Siyi Yang},
Crossref = {conf/coco/2017},
Date-Added = {2019-02-24 13:05:01 +0100},
Date-Modified = {2019-02-24 13:05:01 +0100},
Keywords = {c-acti,irif,Santha,eq-ac},
Title = {On the Polynomial Parity Argument complexity of the Combinatorial Nullstellensatz},
Year = {2017}}