Complexity of linear problems with a fixed output basis
type: Item
instance of: scholarly article
title: Complexity of linear problems with a fixed output basis
zbMATH Open document ID: 0951.68044
published in: Journal of Complexity
publication date: 2000-05-09T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1444131
zbMATH Keywords: information-based complexity
author: Erich Novak
author: H. Woźniakowski
MaRDI profile type: Publication
full work available at URL: jcom.1999.0538
OpenAlex ID: W2056443473
cites work: On the optimality of linear methods for operator approximation in convex classes of functions
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q4356573
cites work: Q4215356
cites work: Q4888905
cites work: Q5538132
cites work: Optimal sequential and non-sequential procedures for evaluating a functional
cites work: Q3709786
cites work: Topological complexity with continuous operations
cites work: s-numbers in information-based complexity
cites work: The real number model in numerical analysis
cites work: On the power of adaption
cites work: Topological complexity of zero-finding
cites work: On the cost of uniform and nonuniform algorithms
cites work: On the topology of algorithms. I
cites work: Q3883494
cites work: Q3993279
cites work: Q4226567
cites work: Q4717968
cites work: Are linear algorithms always good for linear problems?
cites work: Why does information-based complexity use the real number model?
DOI: 10.1006/JCOM.1999.0538
description: scientific article; zbMATH DE number 1444131