Author: Moin Khan
FFT Multiplication: An implementation of the Fast Fourier Transform (FFT) algorithm to multiply two polynomials efficiently.
FFT Multiplication
is a simple, zero-configuration command-line static HTTP server.
pip install fft_multiplication
This will install fft_multiplication
globally so that it can be imported into any python program.
from fft_multiplication import multiply
p = [1, 1]
q = [1, 0]
print(multiply(p, q))
- Efficient polynomial multiplication using the Fast Fourier Transform (FFT) algorithm
- Comparison with the direct multiplication method
- Test cases to ensure correctness of the implementations
Python 3.x
All contributions are welcome. Please create an issue first for any feature request or bug. Then fork the repository, create a branch and make any changes to fix the bug or add the feature and create a pull request. That's it! Thanks!
fft_multiplication is released under the MIT License. Check out the full license here.