Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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.
Possibly Related PublicationsThe following publications are possibly variants of this publication: A 2.5 n-Lower Bound on the Combinational Complexity of Boolean FunctionsWolfgang J. Paul. SICOMP, 6(3):427-443, 1977.
The following publications are possibly variants of this publication: