TY  - RPRT
T1  - A boolean function requiring 3n network size
T3  - Saarbrücken, 1982
A1  - Blum,Norbert
Y1  - 2011/08/02
N2  - Paul [P] first proved a 2.5n-lower bound for the network complexity of an explicit boolean function. We modify the definition of Paul's function a little and prove a 3n-lower bound for the network complexity of that function.
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4065
ER  -