Communication complexity lower bounds by polynomials

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 120-130

  Buhrman, H ^a   De Wolf, R ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NETWORK PROTOCOLS; POLYNOMIALS;

COMMUNICATION COMPLEXITY; QUANTUM COMMUNICATION PROTOCOLS;

COMPUTATIONAL COMPLEXITY;

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

References (36)

1. Quantum dense coding and a lower bound for 1-way quantum finite automata
2. The quantum communication complexity of sampling
3. Complexity classes in communication complexity theory
4. Quantum lower bounds by polynomials
5. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
6. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
7. Quantum fingerprinting
8. Quantum vs. classical communication and computation
9. Bounds for small-error and zero-error quantum algorithms
10. Substituting quantum entanglement for communication
11. Quantum entanglement and the communication complexity of the inner product function
12. Schwankung von Polynomen zwischen Gitterpunkten
13. Polynomials with two values
14. The probabilistic communication complexity of set intersection
15. On rounds in quantum communication
16. On the determinant of (0, 1)-matrices
17. Quantum communication
18. Communication complexity: A survey
19. Communication complexity and combinatorial lattice theory
20. Las Vegas is better than determinism in VLSI and distributed computing
21. Optimal lower bounds for quantum automata and random access codes
22. Interaction in quantum communication complexity
23. CREW PRAMs and decision trees
24. On the degree of Boolean functions as real polynomials
25. On rank vs. communication complexity
26. Exponential separation of quantum and classical communication complexity
27. On the distributional complexity of disjointness
28. A comparison of uniform approximations on an interval and a finite subset thereof
29. Some complexity questions related to distributive computing
30. Quantum circuit complexity