740 search results - page 35 / 148 » Lower bounds for Buchsbaum* complexes |
152
click to vote
DAM
1998
15 years 5 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
163
click to vote
FOCS
2006
IEEE
16 years 4 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
149
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
259
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
167
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...