"One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on ..."

Hartmut Klauck (2007)

> Home

Details and statistics

DOI: 10.1137/S009753970140004X

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Klauck07a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Klauck07a
Hartmut Klauck:
One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. SIAM J. Comput. 37(2): 552-583 (2007)

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.