Easy lower bound for a strange computational model

Abstract

The paper gives a new proof of the well-known lower bound Ω(n logn) for the algebraic complexity of the functionx ⁿ₁ x ⁿ₂ +...+x ⁿ _n (if the characteristic of the ground field does not dividen). As a tool, the proof uses a computational model that counts only duplicators.