Sciweavers

3208 search results - page 136 / 642
» A Lower Bound for Primality
Sort
View
DLOG
2003
15 years 7 months ago
Complexity of Reasoning
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...
Francesco M. Donini
CORR
2010
Springer
89views Education» more  CORR 2010»
15 years 6 months ago
The SIMO Pre-Log Can Be Larger Than the SISO Pre-Log
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,...
Veniamin I. Morgenshtern, Giuseppe Durisi, Helmut ...
DCG
2008
88views more  DCG 2008»
15 years 6 months ago
On the Number of Birch Partitions
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...
Stephan Hell
JC
2007
130views more  JC 2007»
15 years 6 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
JCT
2007
112views more  JCT 2007»
15 years 6 months ago
On generalized Kneser hypergraph colorings
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
Carsten E. M. C. Lange, Günter M. Ziegler