On the cost of uniform and nonuniform algorithms

DOI10.1016/S0304-3975(98)00293-XzbMath0916.68063OpenAlexW1986908839MaRDI QIDQ1292410

Erich Novak, Henryk Woźniakowski

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00293-x

zbMATH Keywords

information-based complexitycontinuous problems and algorithmsuniform algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

Complexity of linear problems with a fixed output basis ⋮ A new algorithm and worst case complexity for Feynman-Kac path integration. ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II

Cites Work

• The real number model in numerical analysis
• Topological complexity of zero-finding
• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item

This page was built for publication: On the cost of uniform and nonuniform algorithms