Dynamic programming on the word RAM
From MaRDI portal
Publication:1566379
DOI10.1007/s00453-002-0989-yzbMath1033.90145OpenAlexW2044474025WikidataQ58826459 ScholiaQ58826459MaRDI QIDQ1566379
Publication date: 2 June 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-0989-y
Related Items (8)
Algorithms in the Ultra-Wide Word Model ⋮ The Unbounded Knapsack Problem ⋮ An improved balanced algorithm for the subset-sum problem ⋮ Where are the hard knapsack problems? ⋮ Exact cover with light ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Maximizing the minimum completion time on parallel machines ⋮ Tight bounds for the identical parallel machine scheduling problem
This page was built for publication: Dynamic programming on the word RAM
