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

Accelerate multiplication using FFT #38

Open

ArtiomTr opened this issue Jun 19, 2022 · 0 comments

Assignees

Labels

Owner

ArtiomTr commented Jun 19, 2022

FFT could optimize multiplication asymptotical complexity from O(N^2) to O(N*log(N)).

ArtiomTr added the enhancement label

ArtiomTr self-assigned this

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