next up previous
Next: Characterization of all Optimal Up: Abstracts Previous: More on the power

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.



Claus Rick
2000-05-10