Parallel information-based complexity
From MaRDI portal
Publication:1186504
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)
numerical integration; parallel processing; information-based complexity; number of points; function approximation; number of processors; solution of Fredholm integral equations
68Q25: Analysis of algorithms and problem complexity
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
Related Items
Parallel information-based complexity of numerical integration on holder classHs,αM(Ω)∗, A note on level-2 condition numbers, Lower bounds for the complexity of Monte Carlo function approximation, 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
