๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Complexity of Halfspace Area Queries

โœ Scribed by Stefan Langerman

Book ID
106149494
Publisher
Springer
Year
2003
Tongue
English
Weight
197 KB
Volume
30
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Complexity of Database Queries
On the Complexity of Database Queries
โœ Christos H. Papadimitriou; Mihalis Yannakakis ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory. We show that, if the query size (or the number of variables in the query) is considered as a parameter, then the relational calculus and its fragments (conjunctive queri

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