On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

@misc{belovs2017polynomialparityargument,
      title={On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz},
      author={Aleksandrs Belovs and Gábor Ivanyos and Youming Qiao and Miklos Santha and Siyi Yang},
      year={2017},
      eprint={1710.08602},
      archivePrefix={arXiv},
      primaryClass={cs.CC},
      url={https://arxiv.org/abs/1710.08602},
}