"The unbounded-error communication complexity of symmetric functions."

Alexander A. Sherstov (2011)

> Home

Details and statistics

DOI: 10.1007/S00493-011-2580-0

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Sherstov11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Sherstov11
Alexander A. Sherstov:
The unbounded-error communication complexity of symmetric functions. Comb. 31(5): 583-614 (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.