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

Author

Blum, Norbert

fYear

1981

fDate

28-30 Oct. 1981

Firstpage

101

Lastpage

108

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;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on

Conference_Location

Nashville, TN, USA

ISSN

0272-5428

Type

DOI

10.1109/SFCS.1981.10

Filename

4568323

Link To Document