Information-based complexity; An overview

G. W. Wasilkowski

Research output: Contribution to journalConference articlepeer-review


The author examines the following questions: Given specific information, what algorithm makes the best use of it, and is this algorithm simple and easy to implement? If information can be selected, what is the best strategy for doing so, and is this strategy adaptive (sequential)? How do the answers to the above questions change for noisy information? It is shown how the answers sometimes lead to sharp complexity bounds. Some generalizations concerning different error criteria, asymptotic setting, and random methods are briefly discussed.

Original languageEnglish
Pages (from-to)374-379
Number of pages6
JournalProceedings of the American Control Conference
StatePublished - 1990
EventProceedings of the 1990 American Control Conference - San Diego, CA, USA
Duration: May 23 1990May 25 1990

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Information-based complexity; An overview'. Together they form a unique fingerprint.

Cite this