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

Wolfgang J. Paul (1975)

> Home

Details and statistics

DOI: 10.1145/800116.803750

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Paul75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Paul75
Wolfgang J. Paul:
A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions. STOC 1975: 27-36

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.