The Computational Complexity of Integer Programming with Alternations

Danny Nguyen, Igor Pak. The Computational Complexity of Integer Programming with Alternations. Math. Oper. Res., 45(1):191-204, 2020. [doi]

@article{NguyenP20-0,
  title = {The Computational Complexity of Integer Programming with Alternations},
  author = {Danny Nguyen and Igor Pak},
  year = {2020},
  doi = {10.1287/moor.2018.0988},
  url = {https://doi.org/10.1287/moor.2018.0988},
  researchr = {https://researchr.org/publication/NguyenP20-0},
  cites = {0},
  citedby = {0},
  journal = {Math. Oper. Res.},
  volume = {45},
  number = {1},
  pages = {191-204},
}