Page "Dynamic programming" Paragraph 0

In mathematics, computer science, and economics, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems.

It is applicable to problems exhibiting the properties of overlapping subproblems which are only slightly smaller and optimal substructure ( described below ).

When applicable, the method takes far less time than naive methods.