Information based complexity is a unified treatment of problems where only partial or approximate information is available. In this approach one states how well a problem should be solved and indicates the type of information available. The theory then tells one optimal information and optimal algorithm and yields bounds on the problem complexity. Recent results addressing one of the problems studied in information based complexity are surveyed. The problem deals with nonadaptive and adaptive information both for the worst case and average case settings.
|Number of pages||5|
|Journal||Proceedings of the IEEE Conference on Decision and Control|
|State||Published - 1984|
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization