1007 search results - page 130 / 202 » The Complexity of Futile Questioning |
85
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
96
Voted
PODS
2003
ACM
16 years 26 days ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
95
Voted
PODS
2004
ACM
16 years 26 days ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
99
Voted
PODS
2006
ACM
16 years 26 days ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
85
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...