Show HN: Compute polynomials twice as fast
21 days ago
- Horner's method evaluates a degree-n polynomial in n multiplications (n−1 if monic).
- With preprocessing of coefficients, ⌊n/2⌋+1 multiplications suffice for monic polynomials, one more for general ones.
- This technique can be used to approximate functions like exp, sin, cos, and is useful in cryptography, hashing, and coding theory.
- Users can input a polynomial and choose a field for preprocessing.