Title :
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.
Keywords :
Boolean functions; Complexity theory; Computer networks; Convolution; MONOS devices;
Conference_Titel :
Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on
Conference_Location :
Nashville, TN, USA
DOI :
10.1109/SFCS.1981.10
