Pages that link to "Item:Q4091364"

The following pages link to Evaluating Polynomials at Fixed Sets of Points (Q4091364):

Displaying 27 items.

• On the complexity of skew arithmetic (Q260085) (← links)
• Genus 2 point counting over prime fields (Q412199) (← links)
• Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
• On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
• On arithmetical algorithms over finite fields (Q910432) (← links)
• Fast evaluation and interpolation at the Chebyshev sets of points (Q918113) (← links)
• Polynomial division and its computational complexity (Q1094135) (← links)
• Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
• Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
• On the complexity of algorithms for the translation of polynomials (Q1133877) (← links)
• Matrix identities of the fast Fourier transform (Q1153410) (← links)
• Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
• A new approach to fast polynomial interpolation and multipoint evaluation (Q1802447) (← links)
• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
• Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
• Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
• Fast systematic encoding of multiplicity codes (Q2422714) (← links)
• An efficient algorithm for multivariate Maclaurin-Newton transformation (Q2442965) (← links)
• Fast multidimensional Bernstein-Lagrange algorithms (Q2443008) (← links)
• Fast computation of special resultants (Q2457312) (← links)
• Symbolic treatment of geometric degeneracies (Q2638833) (← links)
• A Point Counting Algorithm Using Cohomology with Compact Support (Q3091983) (← links)
• Implementing the Tangent Graeffe Root Finding Method (Q5041082) (← links)
• On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms (Q5348227) (← links)
• Nearly optimal computations with structured matrices (Q5919809) (← links)
• Conformal mapping in linear time (Q5962354) (← links)