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.
Claus-Peter Schnorr. A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theoretical Computer Science, 10:83-92, 1980.
Abstract is missing.