29 search results - page 1 / 6 » Lower bounds for linear degeneracy testing |
STOC
2004
ACM
14 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
IEICET
2010
13 years 3 months ago
2010
DAGSTUHL
2007
13 years 6 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
FOCS
2002
IEEE
13 years 9 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)....