A Boolean function requiring 3n network size

Paul (1977) has proved a 2. 5n-lower bound for the network complexity of an explicit Boolean function. We modify the definition of Paul's function slightly and prove a 3n-lower bound for the network complexity of that function.

Authors

• Norbert Blum

Keywords

No keywords are indexed for this paper.