scientific article; zbMATH DE number 69493

MaRDI QIDQ4015003zbMATH OpenFDO

Authors Lu, Hao

Publication date 10 November 1992

zbMATH Keywords

computational complexityNewton's interpolation polynomialparallel algorithmpolynomial computation problemssequential algorithm

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• A Simple Parallel Algorithm for Polynomial Evaluation
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• Fast parallel algorithm for polynomial interpolation
• A Fast Parallel Horner Algorithm
• A parallel method for fast and practical high-order Newton interpolation

Cited in

(21)

• The complexity of evaluating interpolation polynomials
• On solving hard problems by polynomial-size circuits
• On the complexity of the computation of certain classes of polynomials of several variables
• On lower bounds for the complexity of polynomials and their multiples
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• scientific article; zbMATH DE number 5124810 (Why is no real title available?)
• scientific article; zbMATH DE number 3932433 (Why is no real title available?)
• scientific article; zbMATH DE number 4047102 (Why is no real title available?)
• A Polynomial Time Complexity Bound for Computations on Curves
• scientific article; zbMATH DE number 1254031 (Why is no real title available?)
• scientific article; zbMATH DE number 1760347 (Why is no real title available?)
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• On the Complexity of the Interlace Polynomial
• The Complexity of Approximating the Matching Polynomial in the Complex Plane
• Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
• scientific article; zbMATH DE number 6796098 (Why is no real title available?)
• scientific article; zbMATH DE number 2221549 (Why is no real title available?)
• Sets computable in polynomial time on average
• The black-box query complexity of polynomial summation
• On the cell probe complexity of polynomial evaluation
• A polynomial-time algorithm for computing the yolk in fixed dimension

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 Q4015003)