74 search results - page 2 / 15 » Property Testing Lower Bounds via Communication Complexity |
127
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
119
Voted
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
120
click to vote
CORR
2010
Springer
15 years 15 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
91
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
97
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...