scientific article; zbMATH DE number 421669

MaRDI QIDQ3135191zbMATH OpenFDO

Authors Michael F. Singer, Dima Grigoriev, Marek Karpinski

Publication date 29 November 1994

zbMATH Keywords

computational complexityinterpolationreal algebraic functionssparse rational functions

Mathematics Subject Classification ID

Real algebraic sets (14P05) Numerical interpolation (65D05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational Complexity of Sparse Rational Interpolation
• Computational complexity of spline interpolation
• The complexity of sparse polynomial interpolation over finite fields
• scientific article; zbMATH DE number 1273635
• On exact and approximate interpolation of sparse rational functions
• scientific article; zbMATH DE number 917814
• The complexity of evaluating interpolation polynomials
• Randomized Interpolation and Approximation of Sparse Polynomials
• Lower complexity bounds for interpolation algorithms
• Sparse interpolation of multivariate rational functions

Cited in

(6)

• Computability of the additive complexity of algebraic circuits with root extracting
• Zero testing of \(p\)-adic and modular polynomials
• Sparse shifts for univariate polynomials
• Lower complexity bounds for interpolation algorithms
• scientific article; zbMATH DE number 917814 (Why is no real title available?)
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees

This page was built for publication:

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