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

Rahul Jain, Hartmut Klauck, Shengyu Zhang (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-14031-0_8

access: closed

type: Conference or Workshop Paper

metadata version: 2022-12-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/JainKZ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/JainKZ10
Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59

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.