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: ACM Transactions on Computation Theory

Journal publisher: Association for Computing Machinary, Inc.

Published year: 2020

DOI identifier: 10.1145/3397484

ISSN: 1942-3454