منابع مشابه
Lower bounds for kinetic sorting
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted list of the points in S, at any given time. We prove tight lower bounds for this problem, which show the following: with a subquadratic maintenance cost one cannot obtain any significant speed-up on the time needed to ge...
متن کاملLower Bounds For Multidimensional Zero Sums
Let f(n,d) denote the least integer such that any choice of f(n,d) elements in Zdn contains a subset of size n whose sum is zero. Harborth proved that (n− 1)2 + 1 ≤ f(n,d) ≤ (n−1)n+1. The upper bound was improved by Alon and Dubiner to cd n. It is known that f(n,1)=2n−1 and Reiher proved that f(n,2)=4n−3. Only for n=3 it was known that f(n,d)> (n−1)2+1, so that it seemed possible that for a fix...
متن کاملCell-Probe Lower Bounds for Prefix Sums
We prove that to store n bits x ∈ {0, 1}n so that each prefix sum (a.k.a. rank) query Sum(i) := ∑ k≤i xk can be answered by non-adaptively probing q cells of lg n bits, one needs memory n + n/ log n. This matches a recent upper bound of n+ n/ log n by Pǎtraşcu (FOCS 2008), also non-adaptive. We also obtain a n + n/ log O(q) n lower bound for storing a string of balanced brackets so that each Ma...
متن کاملLower Bounds for Dynamic Partial Sums
Let G be a group. The partial sums problem asks to maintain an array A[1 . . n] of group elements, initialized to zeroes (a.k.a. the identity), under the following operations: update(k,∆): modify A[k]← ∆, where ∆ ∈ G. query(k): returns the partial sum ∑k i=1A[i]. For concreteness, let us work on a machine with w-bits words (w ≥ lg n), and take G to be Z/2wZ, i.e. integer arithmetic on machine w...
متن کاملLower Bounds for Sums of Products of Low arity Polynomials
We prove an exponential lower bound for expressing a polynomial as a sum of product of low arity polynomials. Specifically, we show that for the iterated matrix multiplication polynomial, IMMd,n (corresponding to the product of d matrices of size n × n each), any expression of the form IMMd,n = s ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90132-1