"Depth-Independent Lower bounds on the Communication Complexity of ..."

Rahul Jain, Hartmut Klauck, Shengyu Zhang (2009)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-12-01

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-0908-4453
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0908-4453
Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (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.