Combinatorial hardness proofs for polynomial evaluation

Abstract

We exhibit a new method for showing lower bounds for the time complexity of polynomial evaluation procedures. Time, denoted by L, is measured in terms of nonscalar arithmetic operations. The time complexity function considered in this paper is L 2. In contrast with known methods for proving lower complexity bounds, our method is purely combinatorial and does not require powerful tools from algebraic or diophantine geometry.