"Separating the k-party communication complexity hierarchy: an application ..."

Thomas P. Hayes (2011)

> Home

Details and statistics

DOI: 10.46298/DMTCS.546

access: open

type: Journal Article

metadata version: 2023-01-24

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmtcs/Hayes11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/Hayes11
Thomas P. Hayes:
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Discret. Math. Theor. Comput. Sci. 13(4): 15-22 (2011)

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.