A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions - researchr publication

researchr

You are not signed in
Sign in
Sign up

Wolfgang J. Paul. A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, 5-7 May 1975, Albuquerque, New Mexico, USA. pages 27-36, ACM, 1975.

Abstract is missing.

runs on WebDSL