| Name | fft-multiplication JSON |
| Version |
0.0.2
JSON |
| download |
| home_page | |
| Summary | FFT Multiplication |
| upload_time | 2023-05-04 10:02:54 |
| maintainer | |
| docs_url | None |
| author | |
| requires_python | >=3.7 |
| license | |
| keywords |
fft
fft multiplication
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
FFT Multiplication
=======
Author: **[Moin Khan](https://github.com/mo-inkhan)**
# FFT Multiplication: An implementation of the Fast Fourier Transform (FFT) algorithm to multiply two polynomials efficiently.
## Introduction
`FFT Multiplication` is a simple, zero-configuration command-line static HTTP server.
## Installation:
#### Globally via `pip`
pip install fft_multiplication
This will install `fft_multiplication` globally so that it can be imported into any python program.
## Usage:
```python
from fft_multiplication import multiply
p = [1, 1]
q = [1, 0]
print(multiply(p, q))
```
## Features
- Efficient polynomial multiplication using the Fast Fourier Transform (FFT) algorithm
- Comparison with the direct multiplication method
- Test cases to ensure correctness of the implementations
---
## Requirements
Python 3.x
---
## Contributing
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!
---
## License
**fft_multiplication** is released under the MIT License.
Check out the full license [here](LICENSE).
Raw data
{
"_id": null,
"home_page": "",
"name": "fft-multiplication",
"maintainer": "",
"docs_url": null,
"requires_python": ">=3.7",
"maintainer_email": "",
"keywords": "FFT,FFT Multiplication",
"author": "",
"author_email": "Moin Khan <mo.inkhan@aol.com>",
"download_url": "https://files.pythonhosted.org/packages/5b/b0/6ed69c59341b228a903924f4eec57ffccea880bc17a77a0d7301f46d18ec/fft_multiplication-0.0.2.tar.gz",
"platform": null,
"description": "FFT Multiplication\n=======\n\nAuthor: **[Moin Khan](https://github.com/mo-inkhan)**\n\n# FFT Multiplication: An implementation of the Fast Fourier Transform (FFT) algorithm to multiply two polynomials efficiently.\n\n## Introduction\n\n`FFT Multiplication` is a simple, zero-configuration command-line static HTTP server.\n\n## Installation:\n\n#### Globally via `pip`\n\n pip install fft_multiplication\n\nThis will install `fft_multiplication` globally so that it can be imported into any python program.\n\n## Usage:\n\n```python\nfrom fft_multiplication import multiply\n\np = [1, 1]\nq = [1, 0]\n\nprint(multiply(p, q))\n```\n\n## Features\n\n- Efficient polynomial multiplication using the Fast Fourier Transform (FFT) algorithm\n- Comparison with the direct multiplication method\n- Test cases to ensure correctness of the implementations\n\n---\n\n## Requirements\nPython 3.x\n\n---\n\n## Contributing\nAll contributions are welcome. Please create an issue first for any feature request\nor bug. Then fork the repository, create a branch and make any changes to fix the bug\nor add the feature and create a pull request. That's it!\nThanks!\n\n---\n\n## License\n**fft_multiplication** is released under the MIT License.\nCheck out the full license [here](LICENSE).\n",
"bugtrack_url": null,
"license": "",
"summary": "FFT Multiplication",
"version": "0.0.2",
"project_urls": {
"Bug Tracker": "https://github.com/mo-inkhan/FFT-Multiplication/issues",
"Homepage": "https://github.com/mo-inkhan/FFT-Multiplication",
"Source": "https://github.com/mo-inkhan/FFT-Multiplication"
},
"split_keywords": [
"fft",
"fft multiplication"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "f718f76dc8fc7264869476da9d532a952cef2bc29971413910cc447fd668d6e7",
"md5": "6430156764f213f38d453508b38e25a2",
"sha256": "a8575c58139f286e2b30418465db47bb6a438c4e6e1108ba0dfe1d4a6fe30928"
},
"downloads": -1,
"filename": "fft_multiplication-0.0.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "6430156764f213f38d453508b38e25a2",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.7",
"size": 3741,
"upload_time": "2023-05-04T10:02:51",
"upload_time_iso_8601": "2023-05-04T10:02:51.391180Z",
"url": "https://files.pythonhosted.org/packages/f7/18/f76dc8fc7264869476da9d532a952cef2bc29971413910cc447fd668d6e7/fft_multiplication-0.0.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "5bb06ed69c59341b228a903924f4eec57ffccea880bc17a77a0d7301f46d18ec",
"md5": "79c6f8f7470463e75e53d0c770cf2864",
"sha256": "3800210c425c8d8bb0a506a062b662c29f763c37136a05d0ec15e63f63d96949"
},
"downloads": -1,
"filename": "fft_multiplication-0.0.2.tar.gz",
"has_sig": false,
"md5_digest": "79c6f8f7470463e75e53d0c770cf2864",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.7",
"size": 3045,
"upload_time": "2023-05-04T10:02:54",
"upload_time_iso_8601": "2023-05-04T10:02:54.994515Z",
"url": "https://files.pythonhosted.org/packages/5b/b0/6ed69c59341b228a903924f4eec57ffccea880bc17a77a0d7301f46d18ec/fft_multiplication-0.0.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2023-05-04 10:02:54",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "mo-inkhan",
"github_project": "FFT-Multiplication",
"travis_ci": false,
"coveralls": false,
"github_actions": false,
"lcname": "fft-multiplication"
}
