Lower bounds for online integer multiplication and convolution in the cell-probe model

  • Authors:

  • Raphaël Clifford;Markus Jalsenius

  • Affiliations:

  • Department of Computer Science, University of Bristol, Bristol, UK;Department of Computer Science, University of Bristol, Bristol, UK

  • Venue:
  • ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show time lower bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i + 1. We give a lower bound of Ω(δ/w log n) time on average per output digit for this problem where 2δ is the maximum value of a digit. In the convolution problem, we are given a fixed vector V of length n and we consider a stream in which numbers arrive one at a time. We output the inner product of V and the vector that consists of the last n numbers of the stream. We show an Ω(δ/w log n) lower bound for the time required per new number in the stream. All the bounds presented hold under randomisation and amortisation. Multiplication and convolution are central problems in the study of algorithms which also have the widest range of practical applications.