COCO
2004
Springer
14 years 5 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
PODS
2004
ACM
15 years 18 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...
STOC
2006
ACM
15 years 23 days ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...