"New upper bounds on the Boolean circuit complexity of symmetric functions."

Evgeny Demenkov et al. (2010)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2010.01.007

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/DemenkovKKY10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/DemenkovKKY10
Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev:
New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7): 264-267 (2010)

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.