Information-based complexity

@article{Traub1987InformationbasedC,
  title={Information-based complexity},
  author={J. Traub and G. Wasilkowski and H. Wozniakowski},
  journal={Nature},
  year={1987},
  volume={328},
  pages={29-33}
}
Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems. This allows one to determine what is meant by an optimal algorithm in many practical situations, and offers a variety of interesting and sometimes surprising theoretical results. 
508 Citations
The exact information-based complexity of smooth convex minimization
  • Y. Drori
  • Mathematics, Computer Science
  • J. Complex.
  • 2017
  • 31
  • PDF
An Overview of Information-Based Complexity
  • 4
  • PDF
Some basic information on information-based complexity theory
  • 8
  • PDF
On the Power of Standard Information for Weighted Approximation
  • 41
Measures of uncertainty and information in computation
  • 4
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Information-Based Complexity
  • 909
  • PDF
A survey of information-based complexity
  • 31
  • PDF
How powerful is continuous nonlinear information for linear problems?
  • 12
  • PDF
A general theory of optimal algorithms
  • 531
On the optimality of Krylov information
  • 15
Information-based numerical practice
  • 9
  • PDF
On the Optimal Solution of Large Linear Systems
  • 30
  • PDF
Sequential minimax search for a maximum
  • 803
  • PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
  • 47,322
  • PDF
...
1
2
3
4
5
...