Two applications of information complexity

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 673-682

  Jayram, T S ^a   Kumar, Ravi ^a   Sivakumar, D ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

INFORMATION COMPLEXITY;

INFORMATION ANALYSIS;

EID: 0038784485     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780637.780640     Document Type: Conference Paper

References (28)

1. F. Ablayev. Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 157(2): 139-159, 1996.
2. A. V. Aho, J. D. Ullman, and M. Yannakakis. On notions of information transfer in VLSI circuits. In Proc. 15th Annual ACM Symposium on the Theory of Computing, pages 133-139, 1983.
3. R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky. Privacy, additional information, and communication. IEEE Transactions on Information Theory, 39(6):1930-1943, 1993.
4. Z. Bar-Yossef, T. Jayram, R. Kumar, and D. SivaKumar. An information statistics approach to data stream and communication complexity. In Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 209-218, 2002.
5. P. Beame and J. Lawry. Randomized versus nondeterministic communication complexity. In Proc. 24th Annual ACM Symposium on the Theory of Computing, pages 188-199, 1992.
6. M. Ben-Or and N. Linial. Collective coin flipping. In S. Micali, editor, Randomness and Computation, pages 91-115. JAI Press, 1990.
7. M. Blum and R. Impagliazzo. General oracle and oracle classes. In Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, pages 118-126, 1987.
8. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science, 288(1):21-43, 2002.
9. A. Chakrabarti, Y. Shi, A. Wirth, and A. C.-C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science, pages 270-278, 2001.
10. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
11. M. Fürer. The power of randomness for communication complexity. In Proc. 19th Annual ACM Symposium on the Theory of Computing, pages 178-181, 1987.
12. J. Hartmanis and L. Hemachandra. Complexity classes without machines: On complete languages for UP. Theoretical Computer Science, 58:129-142, 1988.
13. R. Heiman, I. Newman, and A. Wigderson. On read-once threshold formulae and their randomized decision tree complexity. Theoretical Computer Science, 107(l):63-76, 1993.
14. R. Heiman and A. Wigderson. Randomized vs. deterministic decision tree complexity for read-once Boolean functions. Computational Complexity, 1:311-329, 1991.
15. J. Hromkovic and G. Schnitger. Nondeterministic communication with a limited number of advice bits. In Proc. 28th Annual ACM Symposium on the Theory of Computing, pages 551-560, 1996.
16. M. Karchmer and A. Wigderson. Monotone circuits for connectivity require super-logarithmic depth. SIAM Journal on Discrete Mathematics, 3(2):255-265, 1990.
17. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
18. J. Lin. Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory, 37(1):145-151, 1991.
19. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
20. N. Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999-1007, 1991.
21. R. Raz and A. Wigderson. Monotone circuits for matching require linear depth, Journal of the ACM, 39(3):736-744, 1992.
22. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proc. of the 34th Annual ACM Symposium on Theory of Computing, pages 360-369, 2002.
23. M. Saks and A. Wigderson. Probabilistic Boolean decision trees and the complexity of evaluating game trees. In Proc. 27th IEEE Symposium on Foundations of Computer Science, pages 29-38, 1986.
24. M. Santha. On the Monte Carlo Boolean decision tree complexity of read-once formulae. Random Structures and Algorithms, 6(1):75-88, 1995.
25. M. Snir. Lower bounds for probabilistic linear decision trees. Theoretical Computer Science, 38:69-82, 1985.
26. A by a random oracle. Combinatorica, 9:385-392, 1990.
27. A. C.-C. Yao. Some complexity questions related to distributive computing. In Proc. 11th Annual ACM Symposium on Theory of Computing, pages 209-213, 1979.
28. A. C.-C. Yao. The entropic limitations on VLSI computations (extended abstract). In Proc. 13th Annual ACM Symposium on Theory of computing, pages 308-311, 1981.