The Pollard-Strassen Method is an integer factorization algorithm. Its time and complexity is about .
This repository represents implementation of this algorithm in Mathematica and Maple.
-
Notifications
You must be signed in to change notification settings - Fork 0
nullrequest/pollard-strassen
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The Pollard-Strassen algorithm implementation in Mathematica and Maple
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published