External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Dusan Knop, Michal Pilipczuk, Marcin Wrochna. Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

Authors

Dusan Knop

This author has not been identified. Look up 'Dusan Knop' in Google

Michal Pilipczuk

This author has not been identified. Look up 'Michal Pilipczuk' in Google

Marcin Wrochna

This author has not been identified. Look up 'Marcin Wrochna' in Google
runs on