scientific article; zbMATH DE number 1254031

zbMATH Open0916.65014MaRDI QIDQ4227014FDOQ4227014

Authors: Eugene Zima 

Publication date: 6 July 1999

Title of this publication is not available (Why is that?)

Recommendations

• Parallel multiplication and powering of polynomials
• On fast multiplication of polynomials over arbitrary algebras
• Very Fast Parallel Polynomial Arithmetic
• scientific article; zbMATH DE number 69493

zbMATH Keywords

complexityparallel computationpolynomial representationmultivariate polynomialsSIMD architecturepolynomial shifttables of finite differences

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Cited In (2)

• Architecture-aware classical Taylor shift by 1
• Title not available (Why is that?)

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