397 search results - page 6 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
111
Voted
SWAT
1994
Springer
15 years 5 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
132
Voted
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
114
click to vote
AIML
2004
15 years 3 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
119
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
139
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...