An O(N4/3) lower bound on the mono tone network complexity of N-TH degree convolution

Abstract

We prove an Ω(n4/3) lower bound for the number of ∧-gates in any monotone network computing n-th degree convolution.