The parallel complexity of function approximation

DOI10.1016/0885-064X(91)90005-IzbMATH Open0741.68058MaRDI QIDQ1179031FDOQ1179031

Authors: Jörg-Detlef Kern 

Publication date: 26 June 1992

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

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

zbMATH Keywords

lower and upper boundssmooth functionsparallel complexity

Mathematics Subject Classification ID

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

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Metric entropy and approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower Bounds for Approximation by Nonlinear Manifolds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal bilinear complexity and codes
• Title not available (Why is that?)

Cited In (15)

• Polynomial estimation of the complexity of algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The actual complexity of parallel evaluation of low degree polynomials
• Parallel information-based complexity
• Computing functions with parallel queries to NP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗
• Problem of checking the functional completeness in the class of piecewise parallel functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids
• Continuous functions and parallel algorithms on concrete data structures
• On parallel complexity of analytic functions

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)