𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Computational Power of Demand Queries

✍ Scribed by Blumrosen, Liad; Nisan, Noam


Book ID
118180697
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
296 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the expressibility and the computabil
✍ Jose Maria Turull Torres πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 202 KB

The work of Chandra and Harel contained in Chandra and Harel (J. Comput. System Sci. 21 (1980) 156 -178) can be considered as the beginning of the construction of a theoretical framework in which the computability and the complexity of queries to relational databases could be studied. In the deΓΏniti

On the computational complexity of query
✍ 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

On the computational power of pushdown a
✍ A.V. Aho; J.D. Ullman; J.E. Hopcroft πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 361 KB

We present a relation between the sets accepted by two-way pushdown automata and certain tape complexity classes of off-line Turing machines. Specifically, let L be a language accepted by a nondeterministic off-line Turing machine T. Let T have a t-symbol storage-tape alphabet. If for all but a fini

Harnessing the Power of Demand
✍ Anjali Sheffrin; Henry Yoshimura; David LaPlante; Bernard Neenan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 600 KB