<http://dbpedia.org/resource/Dynamic_programming>	<http://xmlns.com/foaf/0.1/depiction>	<http://commons.wikimedia.org/wiki/Special:FilePath/Shortest_path_optimal_substructure.svg> .
<http://dbpedia.org/resource/Dynamic_programming>	<http://dbpedia.org/ontology/thumbnail>	<http://commons.wikimedia.org/wiki/Special:FilePath/Shortest_path_optimal_substructure.svg?width=300> .
<http://dbpedia.org/resource/Dynamic_programming>	<http://www.w3.org/2000/01/rdf-schema#comment>	"In mathematics, computer science, economics, and bioinformatics, dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems. It is applicable to problems exhibiting the properties of overlapping subproblems and optimal substructure (described below)."@en .
<http://dbpedia.org/resource/Dynamic_programming>	<http://www.w3.org/2002/07/owl#differentFrom>	<http://dbpedia.org/resource/Dynamic_problem_(algorithms)> .
<http://dbpedia.org/resource/Dynamic_programming>	<http://www.w3.org/2002/07/owl#differentFrom>	<http://dbpedia.org/resource/Dynamic_programming_language> .