New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[주제 제안] O(N log N) Matrix Chain Multiplication #6

Open

justiceHui opened this issue Feb 16, 2020 · 0 comments

Labels

Member

justiceHui commented Feb 16, 2020 •

edited by kimjg1119

Loading

주제 이름

O(N log N) Matrix Chain Multiplication

주제 소개 (3~4줄)

시간복잡도 O(N^3), 공간복잡도 O(N^2)인 DP 풀이가 잘 알려져 있는 행렬 곱셈 순서 문제를 O(N log N) 시간에 푸는 알고리즘

대략적인 난이도

논문을 읽고 구현하면 된다는 소문이 있다.
기본 문제가 루비 3

관련 문제 링크

BOJ18237 행렬 곱셈 순서 3

justiceHui added the 주제 제안 label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment