Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A 3n-Lower Bound on the Network Complexity of Boolean Functions."

Claus-Peter Schnorr (1980)

> Home

Details and statistics

DOI: 10.1016/0304-3975(80)90074-2

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Schnorr80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Schnorr80
Claus-Peter Schnorr:
A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theor. Comput. Sci. 10: 83-92 (1980)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.