397 search results - page 6 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
SWAT
1994
Springer
13 years 11 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...
COCOON
2006
Springer
13 years 11 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...
AIML
2004
13 years 9 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...
STOC
2004
ACM
14 years 7 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...
STOC
2004
ACM
14 years 7 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, ...