On the cost of uniform and nonuniform algorithms

DOI10.1016/S0304-3975(98)00293-XzbMATH Open0916.68063OpenAlexW1986908839MaRDI QIDQ1292410FDOQ1292410

Authors: Erich Novak, H. 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

Recommendations

• scientific article; zbMATH DE number 1859218
• The real number model in numerical analysis
• Machines Over the Reals and Non-Uniformity

zbMATH Keywords

information-based complexitycontinuous problems and algorithmsuniform algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• The real number model in numerical analysis
• Topological complexity of zero-finding
• Computability of String Functions Over Algebraic Structures Armin Hemmerling

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292410)