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

Dusan Knop, Michal Pilipczuk, Marcin Wrochna (2020)

> Home

Details and statistics

DOI: 10.1145/3397484

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/KnopPW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/KnopPW20
Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory 12(3): 19:1-19:19 (2020)

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.