On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590)
From MaRDI portal
scientific article; zbMATH DE number 7378701
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming |
scientific article; zbMATH DE number 7378701 |
Statements
4 August 2021
0 references
integer programming
0 references
strong exponential time hypothesis
0 references
branch-width of a matrix
0 references
fine-grained complexity
0 references
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English)
0 references
