On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963441955 / rank | |||
Normal rank | |||
| Property / title | |||
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English) | |||
| Property / title: On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (English) / rank | |||
Normal rank | |||
Latest revision as of 10:25, 30 July 2024
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
