"An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of ..."

Evgeny Demenkov, Alexander S. Kulikov (2011)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/DemenkovK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/DemenkovK11
Evgeny Demenkov, Alexander S. Kulikov:
An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. Electron. Colloquium Comput. Complex. TR11 (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.