Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-010-9475-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146843586 / rank | |||
Normal rank | |||
Revision as of 23:59, 19 March 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
