"A 4n Lower Bound on the Combinational Complexity of Certain Symmetric ..."

Uri Zwick (1991)

> Home

Details and statistics

DOI: 10.1137/0220032

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/Zwick91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Zwick91
Uri Zwick:
A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions. SIAM J. Comput. 20(3): 499-505 (1991)

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.