𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Space complexity in on-line computation

✍ Scribed by Hajime Machida; Takumi Kasai

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
554 KB
Volume
24
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational complexity on computable m
Computational complexity on computable metric spaces
✍ Klaus Weirauch πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene

Complexity Limitations on Quantum Comput
Complexity Limitations on Quantum Computation
✍ Lance Fortnow; John Rogers πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 141 KB

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP: BQP is low for PP, i.e., PP BQP =PP; There exists a relativized, world, where P=BQP and t

On-line computation of convolutions
On-line computation of convolutions
✍ JiΕ™Γ­ MatouΕ‘ek πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 191 KB
On-line computing in surgery
On-line computing in surgery
✍ J. P. Blackburn πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

for allowing us to study patients under their care, and to Sir Richard Doll (Regius Professor of Medicine, University of Oxford), who prompted us to carry out the investigation.