The relationship between inner product and counting cycles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7256 LNCS, Issue , 2012, Pages 643-654

  Sun, Xiaoming ^a   Wang, Chengu ^b   Yu, Wei ^c  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b TSINGHUA UNIVERSITY   (China)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITENESS; COMMUNICATION COMPLEXITY; CONSTANT DEGREE GRAPHS; INNER PRODUCT; LOWER BOUNDS; PRIME FACTORS; QUANTUM LOWER BOUNDS; QUANTUM PROTOCOLS; STREAMING MODEL;

INFORMATION SCIENCE;

COMMUNICATION;

EID: 84860809991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29344-3_54     Document Type: Conference Paper

References (19)

1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58, 137-147 (1999)
2. Babai, L.: The Fourier transform and equations over finite abelian groups. Lecture Notes, version 1.3 1 (2002)
3. Babai, L., Hayes, T., Kimmel, P.: The cost of the missing bit: Communication complexity with help. Combinatorica 21(4), 455-488 (2001)
4. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. In: Symposium on Foundations of Computer Science, pp. 337-347 (1986)
5. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Symposium on Discrete Algorithms, pp. 623-632 (2002)
6. Chu, J.I., Schnitger, G.: Communication complexity of matrix computation over finite fields. Theory of Computing Systems 28, 215-228 (1995)
7. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: The value of space. In: Symposium on Discrete Algorithms, pp. 745-754 (2005)
8. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theoretical Computer Science 348(2-3), 207-216 (2005)
9. Hajnal, A., Maass, W., Turán, G.: On the communication complexity of graph properties. In: Symposium on Theory of Computing, pp. 186-191 (1988)
10. Harvey, N.J.A.: Matroid intersection, pointer chasing, and young's seminormal representation of s n. In: Symposium on Discrete Algorithms, pp. 542-549 (2008)
11. Horn, R., Johnson, C.: Matrix analysis, vol. 2. Cambridge University Press (1990)
12. Kremer, I.: Quantum Communication. Master's thesis, The Hebrew University of Jerusalem (1995)
13. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)
14. Raz, R., Spieker, B.: On the "log rank"-conjecture in communication complexity. Combinatorica 15, 567-588 (1995)
15. Rosen, K.H.: Elementary Number Theory and Its Applications, 3rd edn. Addison-Wesley (1992)
16. Sherstov, A.A.: The pattern matrix method for lower bounds on quantum communication. In: Symposium on Theory of Computing, pp. 85-94. ACM (2008)
17. Verbin, E., Yu, W.: The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems. In: Symposium on Discrete Algorithms (2011)
18. Yao, A.C.C.: Some complexity questions related to distributive computing. In: Symposium on Theory of Computing, pp. 209-213 (1979)
19. Yao, A.C.C.: Lower bounds by probabilistic arguments. In: Symposium on Foundations of Computer Science, pp. 420-428 (1983)