"Lower bounds in communication complexity based on factorization norms."

Nati Linial, Adi Shraibman (2009)

> Home

Details and statistics

DOI: 10.1002/RSA.20232

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/LinialS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/LinialS09
Nati Linial, Adi Shraibman:
Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34(3): 368-394 (2009)

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.