Communication Complexity And Linearly Ordered Sets
References
- [1] Ahlswede R., Cai N., Tamm U.,, Appl. Math. Lett.(1993), no. 6, 53–58.
- [2] Babaioff M., Blumrosen L., Naor M., Schapira M.,, in: Proc. 9th ACM Conference on Electronic Commerce, ACM, 2008, pp. 88–97.
- [3] Björner A., Kalander J., Lindström B.,, Discrete Appl. Math.(1992), 161–163.
- [4] Kushilevitz E., Nisan N.,, Cambridge University Press, Cambridge, 1997.
- [5] Lovasz L., Sachs M.,, J. Comput. System Sci.(1993), 322–349.
- [6] Mehlhorn K., Schmidt E.,, in: Proc. 14th Ann. ACM Symp. on Theory of Computing, ACM, 1982, pp. 330–337.
- [7] Serwecińska M.,, Bull. Sect. Logic(2004), no. 4, 209–222.
- [8] Yao A.C.,, in: Proc. 11th Ann. ACM Symp. on Theory of Computing, ACM, 1979, pp. 209–213.
DOI: https://doi.org/10.1515/amsil-2015-0008 | Journal eISSN: 2391-4238 (formerly 0860-2107) | Journal ISSN: 0860-2107
Language: English
Page range: 93 - 117
Submitted on: Jul 24, 2014
Published on: Sep 30, 2015
Published by: University of Silesia in Katowice, Institute of Mathematics
In partnership with: Paradigm Publishing Services
Related subjects:
© 2015 Mieczysław Kula, Małgorzata Serwecińska, published by University of Silesia in Katowice, Institute of Mathematics
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.