Upper bounds on multiparty communication complexity of shifts
- 1 January 1996
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 631-642
- https://doi.org/10.1007/3-540-60922-9_51
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Unexpected upper bounds on the complexity of some communication gamesLecture Notes in Computer Science, 1994
- Modified ranks of tensors and the size of circuitsPublished by Association for Computing Machinery (ACM) ,1993
- Rounds in communication complexity revisitedPublished by Association for Computing Machinery (ACM) ,1991
- Multi-party protocolsPublished by Association for Computing Machinery (ACM) ,1983