Article thumbnail
Location of Repository

On the polynomial parity argument complexity of the combinatorial nullstellensatz

By A Belovs, Gábor Ivanyos, Y Qiao, M Santha and S Yang
Topics: QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Publisher: Schloss Dagstuhl Leibniz-Zentrum für Informatik
Year: 2017
DOI identifier: 10.4230/LIPIcs.CCC.2017.30
OAI identifier: oai:eprints.sztaki.hu:9211

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.