Skip to main content
SpringerLink
Log in

Upper bounds on multiparty communication complexity of shifts

  • Conference paper
  • First Online:
STACS 96 (STACS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1046))

Included in the following conference series:

Abstract

We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].

This research was supported by Latvian Science Council Grant No.93.599.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Edmonds and R. Impagliazzo, Towards time-space lower bounds on branching programs, manuscript

    Google Scholar 

  2. A. Chandra, M. Furst and R. Lipton, Multiparty protocols, Proceedings of 15-th ACM STOC, 1983, pp.94–99

    Google Scholar 

  3. J. Håstad and M. Goldmann, On the power of small depth threshold circuits, Proceedings of 31-th FOCS, 1990, pp. 610–618

    Google Scholar 

  4. N. Nisan, A. Wigderson, Rounds in communication complexity revisited, Proceedings of 23-th ACM STOC, 1991, pp. 419–429

    Google Scholar 

  5. P. Pudlak, Unexpected upper bounds on the complexity of some communication games, Proceedings of ICALP'94, Lecture Notes in Computer Science, pp.1–11.

    Google Scholar 

  6. P. Pudlak, V. Rödl, Modified ranks of tensors and the size of circuits, Proceedings of 25-th ACM STOC, 1993, pp. 523–531. (preliminary version of [7])

    Google Scholar 

  7. P. Pudlak, V. Rödl, J. Sgall, Boolean circuits, ranks of tensors and communication complexity, submitted.

    Google Scholar 

  8. P. Pudlak, J. Sgall, An upper bound for a communication game related to space-time tradeoffs, preprint.

    Google Scholar 

  9. Andrew C. Yao, Some complexity questions related to distributive computing, Proceedings of 11-th ACM STOC, 1979, pp.209–213.

    Google Scholar 

  10. Andrew C. Yao, On ACC and threshold circuits, Proceedings of 31-th FOCS, 1990, pp. 619–627.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia

    Andris Ambainis

Authors
  1. Andris Ambainis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Puech Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambainis, A. (1996). Upper bounds on multiparty communication complexity of shifts. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-60922-9_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60922-3

  • Online ISBN: 978-3-540-49723-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation