Table design in dynamic programming
From MaRDI portal
Publication:2509355
DOI10.1016/j.ic.2006.02.006zbMath1098.90081OpenAlexW2040998144MaRDI QIDQ2509355
Robert Giegerich, Peter Steffen
Publication date: 19 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.02.006
Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The node-deletion problem for hereditary properties is NP-complete
- A generalization of Dijkstra's algorithm
- A discipline of dynamic programming over sequence data
- A linear space algorithm for computing maximal common subsequences
- Biological Sequence Analysis
- Algorithms on Strings, Trees and Sequences
- Tree generating regular systems
- The Organization of Computations for Uniform Recurrence Equations
- Depth-First Search and Linear Graph Algorithms
- Algebraic Statistics for Computational Biology
This page was built for publication: Table design in dynamic programming