The algorithm designer versus nature: A game-theoretic approach to information-based complexity
From MaRDI portal
Publication:1100895
DOI10.1016/0885-064X(87)90014-8zbMath0641.68062MaRDI QIDQ1100895
Publication date: 1987
Published in: Journal of Complexity (Search for Journal in Brave)
91A05: 2-person games
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
94A17: Measures of information, entropy
Related Items
A minimax principle for the optimal error of Monte Carlo methods, Quadrature Formulas for Monotone Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average case optimality
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Probabilistic setting of information-based complexity
- Randomization for continuous problems
- Information of varying cardinality
- Do Linear Problems Have Linear Optimal Algorithms?
- Recent developments in information-based complexity