The complexity of evaluating interpolation polynomials

DOI10.1016/0304-3975(85)90078-7zbMath0601.65006OpenAlexW2027137944MaRDI QIDQ1081273

B. George

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90078-7

zbMATH Keywords

complexity boundscoefficients of the Lagrangian interpolation polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Related Items (4)

Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions ⋮ Semi-algebraic decision complexity, the real spectrum, and degree ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks

Cites Work

• The complexity of partial derivatives
• A fast method for interpolation using preconditioning
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of evaluating interpolation polynomials