On the cost of uniform and nonuniform algorithms
type: Item
instance of: scholarly article
title: On the cost of uniform and nonuniform algorithms
zbMATH Open document ID: 0916.68063
DOI: 10.1016/S0304-3975(98)00293-X
author: Erich Novak
author: H. Woźniakowski
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1306137
zbMATH Keywords: uniform algorithms
zbMATH Keywords: continuous problems and algorithms
zbMATH Keywords: information-based complexity
MaRDI profile type: MaRDI publication profile
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q3285650
cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling
cites work: The real number model in numerical analysis
cites work: Topological complexity of zero-finding
cites work: Q3993279
full work available at URL: s0304-3975(98)00293-x
OpenAlex ID: W1986908839
Recommended article: Q4789201
Recommended article: The real number model in numerical analysis
Recommended article: Machines Over the Reals and Non-Uniformity
description: scientific article; zbMATH DE number 1306137