"On the Polynomial Parity Argument Complexity of the Combinatorial ..."

Aleksandrs Belovs et al. (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2017.30

access: open

type: Conference or Workshop Paper

metadata version: 2025-03-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/BelovsIQSY17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BelovsIQSY17
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC 2017: 30:1-30:24

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.