"Tight Complexity Lower Bounds for Integer Linear Programming with Few ..."

Dusan Knop, Michal Pilipczuk, Marcin Wrochna (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2019.44

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/KnopPW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/KnopPW19
Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS 2019: 44:1-44:15

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.