Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory |
scientific article; zbMATH DE number 7276060
Language | Label | Description | Also known as |
---|---|---|---|
English | Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory |
scientific article; zbMATH DE number 7276060 |
Statements
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (English)
0 references
19 November 2020
0 references
formula complexity
0 references
integer programming
0 references
linear programming
0 references
0 references
0 references
0 references
0 references