On the evaluation of some sparse polynomials

DOI10.1090/MCOM/3231zbMath1387.68304OpenAlexW2565661303MaRDI QIDQ4600715

Éric Schost, Dorian Nogneng

Publication date: 12 January 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/3231

zbMATH Keywords

evaluationsparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications

Uses Software

• Arb
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals
• Fast methods to compute the Riemann zeta function
• Interpolating polynomials from their values
• Interpolation of polynomials given by straight-line programs
• On fast multiplication of polynomials over arbitrary algebras
• ISSAC '88, Proceedings of the International Symposium on Symbolic and Algebraic Computation. Rome, Italy, July 4--8, 1988.
• Early termination in sparse interpolation algorithms
• Fast evaluation of modular functions using Newton iterations and the AGM
• The complexity of class polynomial computation via floating point approximations
• Sparse interpolation over finite fields via low-order roots of unity
• Powers of tensors and fast matrix multiplication
• Faster Sparse Interpolation of Straight-Line Programs
• Diversification improves interpolation
• Deterministic methods to find primes
• Fast Library for Number Theory: An Introduction

This page was built for publication: On the evaluation of some sparse polynomials