Construction of very hard functions for multiparty communication complexity

Ján Maňuch

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2000)

  • Volume: 34, Issue: 1, page 61-75
  • ISSN: 0988-3754

How to cite

top

Maňuch, Ján. "Construction of very hard functions for multiparty communication complexity." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 34.1 (2000): 61-75. <http://eudml.org/doc/92624>.

@article{Maňuch2000,
author = {Maňuch, Ján},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {multiparty communication model},
language = {eng},
number = {1},
pages = {61-75},
publisher = {EDP-Sciences},
title = {Construction of very hard functions for multiparty communication complexity},
url = {http://eudml.org/doc/92624},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Maňuch, Ján
TI - Construction of very hard functions for multiparty communication complexity
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 1
SP - 61
EP - 75
LA - eng
KW - multiparty communication model
UR - http://eudml.org/doc/92624
ER -

References

top
  1. [1] L. Babai, N. Nisan and M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, Proceedings, 21st ACM STOC (1989). 
  2. [2] N. Blum, A Boolean function requiring 3n network size. Theoret. Comput. Sci. 28 (1984) 337-345. Zbl0539.94036MR742295
  3. [3] A. K. Chandra, M. L. Furst and R. J. Lipton, Multi-party protocols, Proceedings, 15th ACM STOC (1983) 94-99. 
  4. [4] D. Dolev and T. Feder, Multiparty communication complexity, Proceedings, 30th IEEE FOCS (1989) 428-433. 
  5. [5] D. Dolev and T. Feder, Determinism vs. nondeterminism in multiparty communication complexity. SIAM J. Comput. 21 (1992) 89-893. Zbl0765.68033MR1181405
  6. [6] P. Ďuriš and J. D. P. Rolim, A lower bound on the multiparty communication complexity, STACS'95. Springer-Verlag, Lecture Notes in Comput. Sci. 900 (1995) 350-360. MR1371406
  7. [7] P. Ďuriš, Multiparty communication complexity and very hard functions (to appear). Zbl1087.68036MR2063621
  8. [8] J. Hromkovič, Communication complexity and parallel Computing, An EATCS Series. Springer (1997). Zbl0873.68098MR1442518
  9. [9] E. Kushilevitz and N. Nisan, Communication complexity. Cambridge Univ. Press, xiii (1997). Zbl0869.68048MR1426129
  10. [10] R. J. Lipton and R. Sedgewick, Lower bounds for VLSI, Proceedings, 13th ACM STOC (1981) 300-307. 
  11. [11] O. B. Lupanov, Ob odnom metode sinteza skhem (Russian). Izv. Vyssh. Uchebn. Zaved., Radiofizika 1 (1958) 120-140. 
  12. [12] C. Shannon, The synthesis of two-terminal switching circuits. Bell Syst. Techn. J. 28 (1949) 59-98. MR29860
  13. [13] A. C. Yao, The entropic limitations on VLSI computations, Proceedings, 13th ACM STOC (1981) 308-311. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.