Pages that link to "Item:Q2387413"

The following pages link to Polynomial evaluation and interpolation on special sets of points (Q2387413):

Displaying 34 items.

• On the complexity of skew arithmetic (Q260085) (← links)
• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• On the complexity of the generalized MinRank problem (Q390388) (← links)
• Genus 2 point counting over prime fields (Q412199) (← links)
• On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
• Newton's method and FFT trading (Q979146) (← links)
• Deformation techniques for sparse systems (Q1029552) (← links)
• On the complexity of integer matrix multiplication (Q1635268) (← links)
• Inverse linear difference operators (Q1746360) (← links)
• Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
• Multi-point evaluation in higher dimensions (Q1938507) (← links)
• Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
• Fast transforms over finite fields of characteristic two (Q2229746) (← links)
• Fast algorithms for multivariate interpolation and evaluation at special points (Q2272149) (← links)
• Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
• Fast computation of approximant bases in canonical form (Q2284957) (← links)
• Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
• Truncation bounds for differentially finite series (Q2323059) (← links)
• Fast Lagrange-Newton transformations (Q2371307) (← links)
• Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
• Fast systematic encoding of multiplicity codes (Q2422714) (← links)
• Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
• An efficient algorithm for multivariate Maclaurin-Newton transformation (Q2442965) (← links)
• Algebraic diagonals and walks: algorithms, bounds, complexity (Q2628311) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
• Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields (Q2687269) (← links)
• On the Differential and Full Algebraic Complexities of Operator Matrices Transformations (Q2829987) (← links)
• Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis (Q3597981) (← links)
• An algorithm to recognize regular singular Mahler systems (Q5103764) (← links)
• On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms (Q5348227) (← links)
• Asymptotically fast polynomial matrix algorithms for multivariable systems (Q5423851) (← links)
• Fast convolutions meet Montgomery (Q5444325) (← links)
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)