Fast multipoint evaluation of bivariate polynomials

DOI10.1007/978-3-540-30140-0_49MaRDI QIDQ5464612zbMATH OpenOpenAlexFDO

Authors Michael Nüsken, Martin Ziegler

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Amortized multi-point evaluation of multivariate polynomials
• A unified approach to evaluation algorithms for multivariate polynomials
• Fast multivariate multi-point evaluation revisited
• Fast parallel multi-point evaluation of sparse polynomials
• Efficient evaluation of large polynomials

Cited in

(27)

• An efficient raster evaluation method for univariate polynomials
• Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
• Amortized multi-point evaluation of multivariate polynomials
• Computing Riemann-Roch spaces via Puiseux expansions
• Fast amortized multi-point evaluation
• Fast multivariate multi-point evaluation revisited
• Fast systematic encoding of multiplicity codes
• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• scientific article; zbMATH DE number 5872171 (Why is no real title available?)
• scientific article; zbMATH DE number 1254017 (Why is no real title available?)
• A unified approach to evaluation algorithms for multivariate polynomials
• Fast parallel multi-point evaluation of sparse polynomials
• Fast Multiplication for Skew Polynomials
• Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F _P ^r
• Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
• Efficient evaluation of large polynomials
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• Sparse tensors and subdivision methods for finding the zero set of polynomial equations
• Amortized bivariate multi-point evaluation
• Fast multivariate multipoint evaluation over all finite fields
• Faster modular composition
• Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
• A subquadratic algorithm for computing the L₁-distance between two terrains
• A simple algorithm for trimmed multipoint evaluation
• Faster polynomial multiplication via multipoint Kronecker substitution
• Solving structured linear systems with large displacement rank

This page was built for publication: Fast multipoint evaluation of bivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464612)