Algorithms – ESA 2004
From MaRDI portal
Publication:5464612
DOI10.1007/b100428zbMath1111.68789OpenAlexW2483610301MaRDI QIDQ5464612
Martin Ziegler, Michael Nüsken
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
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (8)
Computing Riemann-Roch spaces via Puiseux expansions ⋮ Fast systematic encoding of multiplicity codes ⋮ Fast amortized multi-point evaluation ⋮ Solving structured linear systems with large displacement rank ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ Fast multivariate multi-point evaluation revisited ⋮ Computing the Distance between Piecewise-Linear Bivariate Functions ⋮ Amortized multi-point evaluation of multivariate polynomials
This page was built for publication: Algorithms – ESA 2004