𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of simulating space-bounded quantum computations

✍ Scribed by John Watrous

Book ID
105768008
Publisher
Springer
Year
2003
Tongue
English
Weight
431 KB
Volume
12
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of online computations
On the complexity of online computations of real functions
✍ Klaus Weihrauch πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences

On the computational complexity of query
On the computational complexity of querying bounds on differences constraints
✍ Vittorio Brusoni; Luca Console; Paolo Terenziani πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import