Incremental versus non-incremental dynamic programming (Q2417149): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1109753
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stasys P. Jukna / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2018.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2792757825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Exact Complexity Results for Straight-Line Computations over Semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for tropical circuits and dynamic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical Complexity, Sidon Sets, and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 12:42, 19 July 2024

scientific article
Language Label Description Also known as
English
Incremental versus non-incremental dynamic programming
scientific article

    Statements

    Incremental versus non-incremental dynamic programming (English)
    0 references
    11 June 2019
    0 references
    dynamic programming
    0 references
    tropical branching program
    0 references
    complexity lower bounds
    0 references
    0 references

    Identifiers