On the Polynomial Parity Argument complexity of the Combinatorial Nullstellensatz (bibtex)
by Alexandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
Reference:
On the Polynomial Parity Argument complexity of the Combinatorial Nullstellensatz (Alexandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang), In 32nd Conference on Computational Complexity, CCC 2017, July 6-9, 2017, Riga, Latvia, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
Bibtex Entry:
@proceedings{conf/coco/2017,
	Booktitle = {32nd Conference on Computational Complexity, {CCC} 2017, July 6-9, 2017, Riga, Latvia},
	Date-Added = {2019-02-24 13:05:01 +0100},
	Date-Modified = {2019-02-24 13:05:01 +0100},
	Publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
	Series = {LIPIcs},
	Year = {2017}}
@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}}
Powered by bibtexbrowser