Keywords

#optimal_substructure

Optimal substructure

Property of a computational problem

In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems. This property is used to determine the usefulness of greedy algorithms for a problem.

Mon 15th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Optimal substructure Bellman equation Dynamic programming Greedy algorithm Overlapping subproblems Optimal binary search tree Addition-chain exponentiation Constraint programming List of algorithms Algorithm
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.