Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688)
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 6028443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems |
scientific article; zbMATH DE number 6028443 |
Statements
Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (English)
0 references
26 April 2012
0 references
dynamic programming
0 references
combinatorial optimization problems
0 references
monotone arithmetic circuits
0 references
0 references
0 references
0 references
0.7715585231781006
0 references
0.7316905856132507
0 references
0.7295011281967163
0 references
0.7234025001525879
0 references
