"One-round multi-party communication complexity of distinguishing sums."

Daniel Apon, Jonathan Katz, Alex J. Malozemoff (2013)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2013.07.026

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/AponKM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AponKM13
Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-round multi-party communication complexity of distinguishing sums. Theor. Comput. Sci. 501: 101-108 (2013)

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.