Rectangle size bounds and threshold covers in communication complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 118-134

  Klauck, Hartmut ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; APPLICATION PROGRAMS; BINARY DECISION DIAGRAMS; COMPUTER SCIENCE; DECISION THEORY; ERRORS; MATHEMATICAL TECHNIQUES; NETWORK PROTOCOLS; VLSI CIRCUITS;

THRESHOLD COVERS;

VLSI CIRCUITS; COMPUTATIONAL COMPLEXITY;

ARBITRARY DISTRIBUTION; COMMUNICATION COMPLEXITY; COMMUNICATION PROBLEMS; COMPLEXITY THEORY; DETERMINISTIC COMMUNICATIONS; LOWER BOUND TECHNIQUES; OPTIMIZATION METHOD; UPPER BOUND;

EID: 0042515224     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [AUY83] A.V. Aho, J.D. Ullman, M. Yannakakis: On Notions of Information Transfer in VLSI Circuits. 15th ACM Symp. on Theory of Computing, pp. 133-139, 1983.
2. [B85] L. Babai. Trading Group Theory for Randomness. 17th ACM Symp. on Theory of Computing, pp. 421-429, 1985.
3. [BFS86] L. Babai, P. Frankl, J. Simon. Complexity classes in communication complexity theory. 27th IEEE Symp. Found. of Comp. Science, pp. 303-312, 1986.
4. [BM88] L. Babai, S. Moran. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. Journal of Computer and System Sciences, vol. 36, pp. 254-276, 1988.
5. [BJKS02] Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar. An Information Statistics Approach to Data Stream and Communication Complexity. 43rd IEEE Symp. Found. of Comp. Science, pp. 209-218, 2002.
6. [HR90] B. Halstenberg, R. Reischuk. Relations between communication complexity classes. Journal of Computer and System Sciences, vol. 41, pp. 402-429, 1990.
7. [HHT97] Y. Han, L.A. Hemaspaandra, T. Thierauf. Threshold Computation and Cryptographic Security. SIAM Journal on Computing, vol.26, pp. 59-78, 1997.
8. [HS96] J. Hromkovič, G. Schnitger. Nondeterministic Communication with a Limited Number of Advice Bits. 28th ACM Symp. on Theory of Computing, pp. 551-560, 1996.
9. [KS92] B. Kalyanasundaram, G. Schnitger. The Probabilistic Communication Complexity of Set Intersection, SIAM Journal on Discrete Mathematics, vol.5, pp. 545-557, 1992.
10. [KNSW94] M. Karchmer, I. Newman, M. Saks, A. Wigderson. Non-deterministic Communication Complexity with Few Witnesses. Journal of Computer and System Sciences, vol. 49, pp. 247-275, 1994.
11. [Kl98] H. Klauck. Lower bounds for computation with limited nondeterminism. 13th IEEE Conference on Computational Complexity, pp. 141-153, 1998.
12. [Kl01] H. Klauck. Lower Bounds for Quantum Communication Complexity. 42nd IEEE Symp. Foundations of Computer Science, pp. 288-297, 2001.
13. [Kl02] H. Klauck. On Quantum and Approximate Privacy. 19th Symposium on Theoretical Aspects of Computer Science, pp. 335-346, 2002.
14. [KN97] E. Kushilevitz, N. Nisan. Communication Complexity. Cambridge University Press, 1997.
15. [R99] R. Raz. Exponential Separation of Quantum and Classical Communication Complexity. 31st ACM Symp. on Theory of Computing, pp. 358-367, 1999.
16. [RW92] R. Raz, A. Wigderson. Monotone Circuits for Matching Require Linear Depth. Journal of the ACM, vol.39, pp. 736-744, 1992.
17. [R92] A. Razborov. On the Distributional Complexity of Disjointness. Theoretical Computer Science, vol. 106, pp. 385-390, 1992.
18. [T79] C.D. Thompson. Area-Time Complexity for VLSI, 11th ACM Symp. on Theory of Computing, pp. 81-88, 1979.
19. [W00] I. Wegener. Branching Programs and Binary Decision Diagrams. SIAM monographs, 2000.
20. [Y79] A.C.C. Yao. Some Complexity Questions Related to Distributed Computing, 11th ACM Symp. on Theory of Computing, pp. 209-213, 1979.
21. [Y83] A.C.C. Yao. Lower Bounds by Probabilistic Arguments. 24th IEEE Symp. Foundations of Computer Science, pp. 420-428, 1983.