"Poly-logarithmic independence fools bounded-depth boolean circuits."

Mark Braverman (2011)

> Home

Details and statistics

DOI: 10.1145/1924421.1924446

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cacm/Braverman11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Braverman11
Mark Braverman:
Poly-logarithmic independence fools bounded-depth boolean circuits. Commun. ACM 54(4): 108-115 (2011)

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.