1331 search results - page 59 / 267 » Complexity bounds for zero-test algorithms |
PODC
2009
ACM
14 years 2 months ago
2009
ACM
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
STOC
1991
ACM
13 years 11 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
FAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...