Danny Nguyen, Igor Pak. The Computational Complexity of Integer Programming with Alternations. In Ryan O'Donnell, editor, 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. Volume 79 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{NguyenP17-5, title = {The Computational Complexity of Integer Programming with Alternations}, author = {Danny Nguyen and Igor Pak}, year = {2017}, doi = {10.4230/LIPIcs.CCC.2017.6}, url = {https://doi.org/10.4230/LIPIcs.CCC.2017.6}, researchr = {https://researchr.org/publication/NguyenP17-5}, cites = {0}, citedby = {0}, booktitle = {32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia}, editor = {Ryan O'Donnell}, volume = {79}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-040-8}, }