Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions."

Wolfgang J. Paul (1977)

> Home

Details and statistics

DOI: 10.1137/0206030

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Paul77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Paul77
Wolfgang J. Paul:
A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions. SIAM J. Comput. 6(3): 427-443 (1977)

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.