scientific article; zbMATH DE number 5356112
From MaRDI portal
Publication:3533259
Recommendations
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
- Search Techniques for Rational Polynomial Orders
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Polynomial root-finding and polynomiography
- scientific article; zbMATH DE number 38950
- scientific article; zbMATH DE number 32398
- New progress in univariate polynomial root finding
- scientific article; zbMATH DE number 880382
- Polynomial Root-Finding Algorithms and Branched Covers
Cited in
(8)- Restrictions on Weil polynomials of Jacobians of hyperelliptic curves
- Cyclotomic generating functions
- The relative class number one problem for function fields. III
- Computing zeta functions of cyclic covers in large characteristic
- Isogeny classes of abelian varieties over finite fields in the LMFDB
- Counting points on curves using a map to \(\mathbf{P}^1\)
- The relative class number one problem for function fields. I
- Improvements to the deformation method for counting points on smooth projective hypersurfaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533259)