3415 search results - page 140 / 683 » Lower Bounds for Kernelizations |
123
click to vote
CRYPTO
2009
Springer
15 years 8 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
120
click to vote
ANTS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
132
click to vote
DLOG
2003
15 years 5 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
104
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Surprisingly,...
133
click to vote
DCG
2008
15 years 4 months ago
2008
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...