536 search results - page 1 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
JC
1998
13 years 10 months ago
1998
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
DCC
2006
IEEE
14 years 10 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
FIWAC
1993
14 years 3 months ago
1993
A new method for obtaining lower bounds for spherical t-designs is proposed. Applications and new bounds are given for t = 9, 10. Some restrictions on the distribution of the inne...
IJCGA
2006
13 years 11 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...