Average case optimality for linear problems
From MaRDI portal
Publication:796299
DOI10.1016/0304-3975(84)90065-3zbMATH Open0543.68029OpenAlexW2150726636MaRDI QIDQ796299FDOQ796299
J. F. Traub, H. Woźniakowski, Grzegorz W. Wasilkowski
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90065-3
Recommendations
- Average case optimality
- Average case optimal algorithms in Hilbert spaces
- Average case complexity of linear multivariate problems
- On linear versus nonlinear approximation in the average case setting
- Complexity of multilinear problems in the average case setting
- Tractability of linear multivariate problems in the average case setting
- Average-case non-approximability of optimisation problems
- Fundamentals of Computation Theory
- Average case complexity of linear multivariate problems. II: Applications
- Average case complexity of linear multivariate problems. I: Theory
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- Soundness and Completeness of an Axiom System for Program Verification
- Expressiveness and the completeness of Hoare's logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Program an Infinite Abacus
- Title not available (Why is that?)
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
- Title not available (Why is that?)
- A New Incompleteness Result for Hoare's System
- Correctness of the compiling process based on axiomatic semantics
- Floyd's principle, correctness theories and program equivalence
- Hoare's logic and Peano's arithmetic
- Consistent and complementary formal theories of the semantics of programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two theorems about the completeness of Hoare's logic
Cited In (32)
- On average case errors in numerical analysis
- The verification of modules
- Recent developments in information-based complexity
- Orthogonal projections are optimal algorithms
- Average complexity of divide-and-conquer algorithms
- Are linear algorithms always good for linear problems?
- Tractability of infinite-dimensional integration in the worst case and randomized settings
- A survey of average case complexity for linear multivariate problems
- Average case optimal algorithms in Hilbert spaces
- On average case complexity of linear problems with noisy information
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Average case complexity of linear multivariate problems
- Average-case analysis of numerical problems
- A stochastic analog to Chebyshev centers and optimal average case algorithms
- s-numbers in information-based complexity
- Can adaption help on the average?
- Complexity of multilinear problems in the worst case setting
- A probabilistic theory for error estimation in automatic integration
- A note on varying cardinality in the average case setting
- Orthogonally invariant measures and best approximation of linear operators
- Title not available (Why is that?)
- Optimal algorithms for computing average temperatures
- Information of varying cardinality
- How powerful is continuous nonlinear information for linear problems?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average case optimality
- The average a posteriori error of numerical methods
- A survey of information-based complexity
- Optimal average case estimation in Hilbert norms
- Solving and learning nonlinear PDEs with Gaussian processes
- Parallel and sequential computation: A statistician's view
This page was built for publication: Average case optimality for linear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796299)
