The parallel complexity of function approximation

DOI10.1016/0885-064X(91)90005-IzbMath0741.68058MaRDI QIDQ1179031

Jörg-Detlef Kern

Publication date: 26 June 1992

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

zbMATH Keywords

parallel complexitylower and upper boundssmooth functions

Mathematics Subject Classification ID

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

Related Items (2)

Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗ ⋮ Parallel information-based complexity

Cites Work

• Maximal bilinear complexity and codes
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Metric entropy and approximation
• Lower Bounds for Approximation by Nonlinear Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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