![](/img/cover-not-exists.png)
A 3n-lower bound on the network complexity of Boolean functions
C.P. SchnorrVolume:
10
Year:
1980
Language:
english
Pages:
10
DOI:
10.1016/0304-3975(80)90074-2
File:
PDF, 972 KB
english, 1980