The following pages link to (Q4789203):
Displaying 6 items.
- Computing \(x^ m\mod p(x)\) and an application to splitting a polynomial into factors over a fixed disc (Q674751) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors (Q2365420) (← links)
- An efficient algorithm for the complex roots problem (Q2565192) (← links)
