Randomized communication complexity for linear Algebra problems over finite fields

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 477-488

  Sun, Xiaoming ^a   Wang, Chengu ^b  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Communication complexity; Determinant; Matrix; Singularity; Streaming

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION COMPLEXITY MODELS; COMMUNICATION MATRIXES; DETERMINANT; DETERMINISTIC COMMUNICATIONS; LINEAR ALGEBRA PROBLEMS; SINGULARITY; SINGULARITY PROBLEMS;

ACOUSTIC STREAMING; ALGORITHMS; COMPUTER SCIENCE; FOURIER ANALYSIS; LINEAR ALGEBRA; MATRIX ALGEBRA;

COMMUNICATION;

EID: 84880314853     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.477     Document Type: Conference Paper

References (18)

1. László Babai, Peter Frankl, and Janos Simon. Complexity classes in communication complexity theory. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 337-347, Washington, DC, USA, 1986. IEEE Computer Society.
2. Harry Buhrman and Ronald de Wolf. Communication complexity lower bounds by polynomials. In IEEE Conference on Computational Complexity, pages 120-130, 2001.
3. J. I. Chu and G. Schnitger. Communication complexity of matrix computation over finite fields. Theory of Computing Systems, 28: 215-228, 1995. 10.1007/BF01303056.
4. Kenneth L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In Proceedings of the 41st annual ACM symposium on Theory of computing, STOC '09, pages 205-214, New York, NY, USA, 2009. ACM.
5. Roger A. Horn and Charles R. Johnson. Matrix analysis. Cambridge Univ Pr, 1990.
6. I. Kremer. Quantum communication. PhD thesis, Citeseer, 1995.
7. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge Univ Pr, 1997.
8. Troy Lee and Adi Shraibman. Lower bounds in communication complexity: A survey.
9. Zhi-Quan Luo and John N. Tsitsiklis. On the communication complexity of distributed algebraic computation. J. ACM, 40: 1019-1047, November 1993.
10. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. In Proceedings of the 27th annual ACM symposium on Theory of computing, STOC '95, pages 103-111, New York, NY, USA, 1995. ACM.
11. Ran Raz. Fourier analysis for probabilistic communication complexity. Computational Complexity, 5: 205-221, 1995. 10.1007/BF01206318.
12. AA Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67: 145-159, 2003.
13. Alexander A. Sherstov. The pattern matrix method for lower bounds on quantum communication. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 85-94, New York, NY, USA, 2008. ACM.
14. Yaoyun Shi and Yufan Zhu. Quantum communication complexity of block-composed functions. Quantum Information and Computation, 9: 444-460, May 2009.
15. Andrew C. Yao. Lower bounds by probabilistic arguments. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 420-428, Washington, DC, USA, 1983. IEEE Computer Society.
16. Andrew Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 7th annual ACM symposium on Theory of computing, STOC '79, pages 209-213, New York, NY, USA, 1979. ACM.
17. Zhiqiang Zhang and Yaoyun Shi. Communication complexities of symmetric xor functions. Quantum Information and Computation, 9: 255-263, March 2009.
18. Zhiqiang Zhang and Yaoyun Shi. On the parity complexity measures of boolean functions. Theoretical Computer Science, 411(26-28): 2612-2618, 2010.