Dusan Knop, Michal Pilipczuk, Marcin Wrochna. Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
No references recorded for this publication.
No citations of this publication recorded.