𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two Models of Information Costs Based on Computational Complexity

✍ Scribed by Mario Eboli

Book ID
110418102
Publisher
Springer US
Year
2003
Tongue
English
Weight
142 KB
Volume
21
Category
Article
ISSN
1572-9974

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On computational complexity of invalidat
On computational complexity of invalidating structured uncertainty models
✍ Onur Toker; Jie Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 102 KB

In this paper we study a class of uncertainty model validation=invalidation problems for linear discrete-time systems. We consider models described by a linear fractional transformation (LFT) of modeling uncertainties, which are structured, time invariant or time varying, and are bounded in H ∞ or '

Complexity of Computer Computations || P
Complexity of Computer Computations || Permuting Information in Idealized Two-Level Storage
✍ Miller, Raymond E.; Thatcher, James W.; Bohlinger, Jean D. πŸ“‚ Article πŸ“… 1972 πŸ› Springer US 🌐 English βš– 523 KB

The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh