The parallel complexity of function approximation

DOI10.1016/0885-064X(91)90005-IMaRDI QIDQ1179031zbMATH OpenFDO

Authors Jörg-Detlef Kern

Publication date 26 June 1992

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

lower and upper boundssmooth functionsparallel complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Parallel information-based complexity
• On parallel evaluation of certain classes of polynomials with an increasing number of variables
• A Fast Parallel Horner Algorithm
• A Simple Parallel Algorithm for Polynomial Evaluation

Cites work

• scientific article; zbMATH DE number 3142276 (Why is no real title available?)
• scientific article; zbMATH DE number 3913670 (Why is no real title available?)
• scientific article; zbMATH DE number 3742483 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 3215519 (Why is no real title available?)
• scientific article; zbMATH DE number 3246460 (Why is no real title available?)
• Lower Bounds for Approximation by Nonlinear Manifolds
• Maximal bilinear complexity and codes
• Metric entropy and approximation
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Cited in

(15)

• Polynomial estimation of the complexity of algorithms
• scientific article; zbMATH DE number 1254029 (Why is no real title available?)
• scientific article; zbMATH DE number 4057841 (Why is no real title available?)
• The actual complexity of parallel evaluation of low degree polynomials
• Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗
• scientific article; zbMATH DE number 647665 (Why is no real title available?)
• Parallel information-based complexity
• Continuous functions and parallel algorithms on concrete data structures
• scientific article; zbMATH DE number 4015931 (Why is no real title available?)
• Problem of checking the functional completeness in the class of piecewise parallel functions
• On parallel complexity of analytic functions
• scientific article; zbMATH DE number 3858283 (Why is no real title available?)
• scientific article; zbMATH DE number 697771 (Why is no real title available?)
• Computing functions with parallel queries to NP
• Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids

This page was built for publication: The parallel complexity of function approximation

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