Affiliation:
1. Department of Computer Science, Princeton University, Princeton, New Jersey 08544, United States of America
Abstract
Given an array A with n entries in an additive semigroup, and m intervals of the form Ii=[i,j], where 0<i<j≤n, we show that the computation of A[i]+⋯+A[j] for all Ii, requires Ω(n+mα(m,n)) semigroup additions. Here, α is the functional inverse of Ackermann's function. A matching upper bound has already been demonstrated.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献