1225 search results - page 19 / 245 » The Instance Complexity Conjecture |
102
Voted
EUROCRYPT
1987
Springer
15 years 7 months ago
1987
Springer
Sequences with almost perfect linear complexity profile are defined by H. Niederreiter[4]. C.P. Xing and K.Y. Lam[5, 6] extended this concept from the case of single sequences to ...
128
Voted
ECCC
2010
15 years 1 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
108
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
99
Voted
CCA
2009
Springer
15 years 10 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
107
Voted
MP
2008
15 years 3 months ago
2008
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax 1, x 0 (1)...