pishleback / pishleback/Algebraeon
Berlekamp-Zassenhaus Algorithm (d-2) test
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 82
- Forks
- 10
- PR merge metrics
- No merged PRs in 30d
Description
Implement the (d-2) test in the Berlekamp-Zassenhaus algorithm. This test can rule out some cases missed by the (d-1) test. Where the (d-1) test does a sanity check on the (d-1) coefficients, the (d-2) test does a sanity check on the (d-2) coefficients. A lookup table for the products of the (d-1) coefficients will need to be pre-computed.
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 by locating the existing Berlekamp-Zassenhaus implementation and its (d-1) test. Read how the (d-1) coefficient sanity check works, then identify where the pre-computed lookup table for products belongs. Done means the (d-2) test is implemented and can rule out the additional cases described in the issue.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100