Parallel information-based complexity

DOI10.1016/0885-064X(91)90024-RzbMath0768.68044MaRDI QIDQ1186504

Stefan Heinrich, Jörg-Detlef Kern

Publication date: 28 June 1992

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

zbMATH Keywords

numerical integrationparallel processinginformation-based complexitynumber of pointsfunction approximationnumber of processorssolution of Fredholm integral equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗ ⋮ Lower bounds for the complexity of Monte Carlo function approximation ⋮ A note on level-2 condition numbers ⋮ A parallel information-based complexity approach to visual surface reconstruction

Cites Work

• Properties of complexity measures for PRAMs and WRAMs
• Fast computation of divided differences and parallel Hermite interpolation
• On sequential and parallel solution of initial value problems
• A survey of information-based complexity
• Variational properties of averaged equations for periodic media
• The parallel complexity of function approximation
• The Computational Complexity of Continued Fractions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel information-based complexity