The following pages link to Algorithms – ESA 2004 (Q5464612):
Displaying 20 items.
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- An efficient raster evaluation method for univariate polynomials (Q1094080) (← links)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- (Q3086664) (← links)
- (Q4226999) (← links)
- A unified approach to evaluation algorithms for multivariate polynomials (Q4372657) (← links)
- Computing the Distance between Piecewise-Linear Bivariate Functions (Q4962199) (← links)
- Fast Multiplication for Skew Polynomials (Q5119925) (← links)
- Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F <i> <sub>P</sub> <sup>r</sup> </i> (Q5145994) (← links)
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
- Sparse tensors and subdivision methods for finding the zero set of polynomial equations (Q6660334) (← links)
- Amortized bivariate multi-point evaluation (Q6666534) (← links)
