"The complexity of depth-3 circuits computing symmetric Boolean functions."

Guy Wolfovitz (2006)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2006.06.008

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Wolfovitz06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Wolfovitz06
Guy Wolfovitz:
The complexity of depth-3 circuits computing symmetric Boolean functions. Inf. Process. Lett. 100(2): 41-46 (2006)

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.