x
Redirected from 동적 계획법
Dynamic programming (DP, 동적 계획법) is both a mathematical optimization method and a computer programming method. (https://en.wikipedia.org/wiki/Dynamic_programming)
복잡한 문제를 간단한 여러 개의 문제로 나누어 푸는 방법. Greedy algorithm과 비교 가능.
관련정보
- 파이썬으로 푸는 피보나치 수열 문제 : Python으로 Fibonacci number 수열 문제 해결
- Simple recursion - O(c^n)
- Memoization - O(n)
- Fast multiplication - O(n)
- Matrix multiplication & Exponentiation - O(log(n))
Incoming Links #
Related Articles (Article 0) #
Suggested Pages #
- 0.666 Machine learning
- 0.057 Kubeflow
- 0.031 Text-to-image model
- 0.025 Programming language
- 0.013 Keras
- 0.013 Linear discriminant analysis
- 0.013
- 0.012
- 0.012 June 10
- 0.012 November 15
- More suggestions...