Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688)

From MaRDI portal
Revision as of 03:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic programming
    0 references
    combinatorial optimization problems
    0 references
    monotone arithmetic circuits
    0 references
    0 references