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

Evgeny Demenkov, Alexander S. Kulikov (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22993-0_25

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/DemenkovK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DemenkovK11
Evgeny Demenkov, Alexander S. Kulikov:
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. MFCS 2011: 256-265

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.