pishleback / pishleback/Algebraeon
Improve univariate polynomial multiplication
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 82
- Forks
- 10
- PR merge metrics
- No merged PRs in 30d
Description
Improve the current univariate polynomial multiplication algorithm https://github.com/pishleback/Algebraeon/blob/c10ee6f5e6019e58ef75d6d777545f4ea63f28f7/rings/src/polynomial/polynomial.rs#L160
There are faster algorithms, but maybe it makes sense to start with Karatsuba.
In sagemath they use different thresholds depending on the base ring: https://github.com/sagemath/sage/blob/d617df423d7530e656571f6cd4ced322235d768a/src/sage/rings/polynomial/polynomial_ring.py#L1622
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start in rings/src/polynomial/polynomial.rs around line 160 and trace the current univariate multiplication implementation. Read the linked Karatsuba notes and Sage's polynomial ring threshold logic for comparison. Done means the multiplication algorithm is improved, with any base-ring-specific threshold behavior accounted for.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100