Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Dušan Knop; Michał Pilipczuk; Marcin Wrochna

Journal title: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2019

DOI identifier: 10.4230/lipics.stacs.2019.44