Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
| Publication | Article in ACM Transactions on Computation Theory, published June 2020 |
|---|---|
| Authors | Dušan Knop, Michał Pilipczuk, Marcin Wrochna |
This is the public page for a publication record in Dimensions, a free research insights platform that brings together information about funding, scholarly outputs, policy, patents and grants.
Loading metrics…