"Separation of Unbounded-Error Models in Multi-Party Communication Complexity."

Arkadev Chattopadhyay, Nikhil S. Mande (2018)

> Home

Details and statistics

DOI: 10.4086/TOC.2018.V014A021

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/ChattopadhyayM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/ChattopadhyayM18
Arkadev Chattopadhyay, Nikhil S. Mande:
Separation of Unbounded-Error Models in Multi-Party Communication Complexity. Theory Comput. 14(1): 1-23 (2018)

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.