Infused with the wisdom of Richard Bellman, the father of Dynamic Programming, this tiny book distills the inherent concepts and techniques in a problem-solution format with focus on :

* to convey the art of formulating the solution of problems in terms of dynamic-programming recurrence relations
* how to define and characterize the optimal value function
* evaluation of the feasibility and computational magnitude of the solution, based on the recurrence relation
* to show how dynamic programming can be used analytically to establish the structure of the optimal solution, or conditions necessarily satisfied by the optimal solution, both for their own interest and as means of reducing computation.

This book was planned as an aid to students preparing for competitive programming. Written in a problem-solution format, this is exceptionally convenient for analyzing common errors made by the coder in competitive coding sports, for reviewing...