740 search results - page 29 / 148 » Lower bounds for Buchsbaum* complexes |
CRYPTO
2009
Springer
15 years 3 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...
DLOG
2003
15 years 1 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...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
125
click to vote
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
108
click to vote
TOC
2008
14 years 11 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for