| dbo:abstract |
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems. For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems. The problem of computing the nth Fibonacci number F(n), can be broken down into the subproblems of computing F(n − 1) and F(n − 2), and then adding the two. The subproblem of computing F(n − 1) can itself be broken down into a subproblem that involves computing F(n − 2). Therefore, the computation of F(n − 2) is reused, and the Fibonacci sequence thus exhibits overlapping subproblems. A naive recursive approach to such a problem generally fails due to an exponential complexity. If the problem also shares an optimal substructure property, dynamic programming is a good way to work it out. (en) |
| dbo:wikiPageID |
1180800 (xsd:integer) |
| dbo:wikiPageLength |
4707 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
964753477 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Memoization dbc:Dynamic_programming dbr:Optimal_substructure dbr:Computational_problem dbr:Computer_science dbr:C_(programming_language) dbr:Dynamic_programming dbr:Fibonacci_number dbr:Fibonacci_sequence dbr:Recursive dbr:Exponential_time |
| dct:subject |
dbc:Dynamic_programming |
| gold:hypernym |
dbr:Times |
| rdf:type |
dbo:Person |
| rdfs:comment |
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems. A naive recursive approach to such a problem generally fails due to an exponential complexity. If the problem also shares an optimal substructure property, dynamic programming is a good way to work it out. (en) |
| rdfs:label |
Overlapping subproblems (en) |
| owl:sameAs |
freebase:Overlapping subproblems wikidata:Overlapping subproblems https://global.dbpedia.org/id/4suuH |
| prov:wasDerivedFrom |
wikipedia-en:Overlapping_subproblems?oldid=964753477&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Overlapping_subproblems |
| is dbo:wikiPageRedirects of |
dbr:Overlapping_subproblem |
| is dbo:wikiPageWikiLink of |
dbr:Partial_correlation dbr:Algorithm dbr:Algorithmic_technique dbr:Longest_common_subsequence_problem dbr:List_of_terms_relating_to_algorithms_and_data_structures dbr:Overlapping_subproblem |
| is foaf:primaryTopic of |
wikipedia-en:Overlapping_subproblems |