どうてきけいかくほう
動的計画法
1. dynamic programming; DPComputing
2. Dynamic programmingIn mathematics and computer science, 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. The key idea behind dynamic programming is quite simple.
Read “Dynamic programming” on English Wikipedia
Read “動的計画法” on Japanese Wikipedia
Read “Dynamic programming” on DBpedia
Read “Dynamic programming” on English Wikipedia
Read “動的計画法” on Japanese Wikipedia
Read “Dynamic programming” on DBpedia
Discussions
Log in to talk about this word.