Tight complexity lower bounds for integer linear programming with few constraints (Q5090494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7559153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight complexity lower bounds for integer linear programming with few constraints |
scientific article; zbMATH DE number 7559153 |
Statements
18 July 2022
0 references
integer linear programming
0 references
fixed-parameter tractability
0 references
ETH
0 references
0.987842321395874
0 references
0.806788444519043
0 references
0.8033883571624756
0 references
0.7887877225875854
0 references
0.7793373465538025
0 references
