"Lower Bounds on the Randomized Communication Complexity of Read-Once ..."

Nikos Leonardos, Michael E. Saks (2010)

> Home

Details and statistics

DOI: 10.1007/S00037-010-0292-2

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/LeonardosS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/LeonardosS10
Nikos Leonardos, Michael E. Saks:
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Comput. Complex. 19(2): 153-181 (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.