Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Communication Versus Computation

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

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

Included in the following conference series:

Abstract

We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is the following: Is there a computational task that exhibits a strong tradeoff behavior between the amount of communication and the amount of time needed for local computation?

Under various standard assumptions, we exhibit boolean functions that show strong tradeoffs in the following computation models: (1) two-party randomized communication complexity; (2) query complexity; (3) property testing. For the model of deterministic communication complexity, we show a similar result relative to a random oracle.

Finally, we study a time-degree tradeoff problem that arises in arithmetization of boolean functions, and relate it to time-communication tradeoff questions in multi-party communication complexity and in cryptography.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babai, L., Gál, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM Journal of Computing 33(1), 137–166 (2003) (Preliminary Version in 12th STACS (1995))

    Article  MATH  Google Scholar 

  2. Beame, P., Tompa, M., Yan, P.: Communication-space tradeoffs for unrestricted protocols. SIAM Journal of Computing 23(3), 652–661 (1994) (Preliminary Version in 31st FOCS (1990))

    Article  MATH  MathSciNet  Google Scholar 

  3. Canetti, R., Goldreich, O.: Bounds on tradeoffs between randomness and communication complexity. Computational Complexity 3, 141–167 (1993) (Preliminary Version in 31st FOCS (1990))

    Article  MATH  MathSciNet  Google Scholar 

  4. Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proc. 15th ACM Symp. on Theory of Computing, Boston, Massachusetts, April 25-27, pp. 94–99 (1983)

    Google Scholar 

  5. Duris, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity. Information and Computation 73(1), 1–22 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proc. 21st ACM Symp. on Theory of Computing, Seattle, Washington, May 15–17, pp. 25–32 (1989)

    Google Scholar 

  7. Harsha, P., Ishai, Y., Kilian, J., Nissim, K., Venkatesh, S.: Communication vs. computation. Technical Report (to be posted in ECCC), Available at http://theory.csail.mit.edu/~prahladh/papers/

  8. Håstad, J., Schrift, A.W., Shamir, A.: The discrete logarithm modulo a composite hides O(n) bits. Journal of Computer and System Sciences 47(3), 376–404 (1993) (Preliminary Version in 22nd STOC (1990))

    Article  MATH  MathSciNet  Google Scholar 

  9. Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal of Computing 22 22(1), 211–219 (1993) (Preliminary Version in 23rd STOC (1991))

    Article  MATH  MathSciNet  Google Scholar 

  10. Papadimitriou, C.H., Sipser, M.: Communication complexity. Journal of Computer and System Sciences 28(2), 260–269 (1984) (Preliminary Version in 14th STOC (1982))

    Article  MATH  MathSciNet  Google Scholar 

  11. Schrift, A.W., Shamir, A.: The discrete log is very discreet. In: Proc. 22nd ACM Symp. on Theory of Computing, Baltimore, Maryland, May 14-16, pp. 405–415 (1990)

    Google Scholar 

  12. Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: Proc. 11th ACM Symp. on Theory of Computing, Atlanta, Georgia, April 30-May 2, pp. 209–213 (1979)

    Google Scholar 

  13. Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: Proc. 27th IEEE Symp. on Foundations of Comp. Science, Toronto, Ontario, Canada, October 27-29, pp. 162–167 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, 02139, USA

    Prahladh Harsha

  2. Computer Science Department, Technion, Haifa, 32000, Israel

    Yuval Ishai

  3. NEC Laboratories America Inc, Princeton, NJ, 08540, USA

    Joe Kilian

  4. Microsoft Research, SVC, 1065 La Avenida, Mountain View, CA, 94043, USA

    Kobbi Nissim

  5. Computer Science Department, University of Victoria, Victoria, BC, Canada, V8W 3P6

    S. Venkatesh

Authors
  1. Prahladh Harsha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuval Ishai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joe Kilian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kobbi Nissim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. S. Venkatesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harsha, P., Ishai, Y., Kilian, J., Nissim, K., Venkatesh, S. (2004). Communication Versus Computation. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_63

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation