Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:02, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems |
scientific article |
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
