Complexity of Dynamic Programming is a theoretical framework in algorithmic complexity analysis that characterizes the time and space requirements of dynamic programming algorithms by accounting for the interplay between overlapping subproblems and optimal substructure in recursive problem decomposition.
46
Publications
1.6K
Citations
90
Authors
60
Institutions
Publications per year
2017–2026
8
Parents
Publications
46
Saving space by algebraization
Daniel Lokshtanov, Jesper Nederlof · 2010 · 85 citations
The complexity of dynamic programming
Chee-Seng. Chow, John N. Tsitsiklis · Journal of Complexity · 1989 · 73 citations
1–5 of 46
Authors
90
- JM
2
h-index
- KC
2
h-index
- BK
2
h-index
- HF
2
h-index
- GJ
2
h-index
1–5 of 90
Institutions
60
Georgia Institute of Technology
Atlanta, United States
2 h-index
2 publications
33 citations
RWTH Aachen University
Aachen, Germany
2 h-index
2 publications
32 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
6 publications
96 citations
University of Houston
Houston, United States
2 h-index
6 publications
144 citations
University of West Florida
Pensacola, United States
1 h-index
1 publications
48 citations
Institute of Mathematics
Warsaw, Poland
1 h-index
1 publications
11 citations
ETH Zurich
Zurich, Switzerland
1 h-index
3 publications
36 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
146 citations
1–8 of 60
Venues
- Journal of Optimization Theory and Applications
3 publications · 99 citations
3
h-index
- Journal of Mathematical Analysis and Applications
3 publications · 63 citations
3
h-index
- Mathematics of Computation
MCOM · 2 publications · 133 citations
2
h-index
- TU/e Research Portal
Repository · 1 publications · 15 citations
1
h-index
- Theoretical Computer Science
1 publications · 10 citations
1
h-index
1–5