Sciweavers

1274 search results - page 245 / 255
» New Proofs for
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ERSHOV
1989
Springer
13 years 11 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
ATAL
2006
Springer
13 years 11 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
FQAS
2006
Springer
186views Database» more  FQAS 2006»
13 years 11 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen