메뉴 건너뛰기




Volumn 6198 LNCS, Issue PART 1, 2010, Pages 475-489

Composition theorems in communication complexity

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; COMPOSITION THEOREM; INNER FUNCTIONS; LOWER BOUNDS; MATRIX; PATTERN MATRIX; POLYNOMIAL DEGREE; QUANTUM COMMUNICATION COMPLEXITY; SIMPLE GROUPS;

EID: 77955333643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_41     Document Type: Conference Paper
Times cited : (25)

References (31)
  • 1
    • 0345106484 scopus 로고    scopus 로고
    • Quantum lower bounds by polynomials
    • Earlier version in FOCS 1998
    • Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48 (4), 778-797 (2001); Earlier version in FOCS 1998
    • (2001) Journal of the ACM , vol.48 , Issue.4 , pp. 778-797
    • Beals, R.1    Buhrman, H.2    Cleve, R.3    Mosca, M.4    Wolf, R.5
  • 4
    • 0026940019 scopus 로고
    • Multiparty protocols, pseudorandom generators for Logspace, and time-space trade-offs
    • Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for Logspace, and time-space trade-offs. Journal of Computer and System Sciences 45, 204-232 (1992)
    • (1992) Journal of Computer and System Sciences , vol.45 , pp. 204-232
    • Babai, L.1    Nisan, N.2    Szegedy, M.3
  • 5
    • 0037048579 scopus 로고    scopus 로고
    • Complexity measures and decision tree complexity: A survey
    • Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: A survey. Theoretical Computer Science 288, 21-43 (2002)
    • (2002) Theoretical Computer Science , vol.288 , pp. 21-43
    • Buhrman, H.1    Wolf, R.2
  • 12
    • 68149169176 scopus 로고    scopus 로고
    • Disjointness is hard in the multiparty number-onthe-forehead model
    • Lee, T., Shraibman, A.: Disjointness is hard in the multiparty number-onthe-forehead model. Computational Complexity 18 (2), 309-336 (2009)
    • (2009) Computational Complexity , vol.18 , Issue.2 , pp. 309-336
    • Lee, T.1    Shraibman, A.2
  • 15
    • 67649118164 scopus 로고    scopus 로고
    • Lower bounds in communication complexity based on factorization norms
    • Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. Random Structures and Algorithms 34, 368-394 (2009)
    • (2009) Random Structures and Algorithms , vol.34 , pp. 368-394
    • Linial, N.1    Shraibman, A.2
  • 17
    • 0013527169 scopus 로고
    • The communication complexity of threshold gates
    • Paul Erdos is Eighty
    • Nisan, N.: The communication complexity of threshold gates. In: Proceedings of Combinatorics, Paul Erdos is Eighty, pp. 301-315 (1994)
    • (1994) Proceedings of Combinatorics , pp. 301-315
    • Nisan, N.1
  • 18
    • 0000607672 scopus 로고
    • On the degree of Boolean functions as real polynomials
    • Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Computational Complexity 4, 301-313 (1994)
    • (1994) Computational Complexity , vol.4 , pp. 301-313
    • Nisan, N.1    Szegedy, M.2
  • 20
    • 33748500069 scopus 로고    scopus 로고
    • Quantum communication complexity of symmetric predicates
    • Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics 67 (1), 145-159 (2003)
    • (2003) Izvestiya: Mathematics , vol.67 , Issue.1 , pp. 145-159
    • Razborov, A.1
  • 22
    • 2442696655 scopus 로고    scopus 로고
    • Towards proving strong direct product theorems
    • Shaltiel, R.: Towards proving strong direct product theorems. Computational Complexity 12 (1- 2), 1-22 (2003)
    • (2003) Computational Complexity , vol.12 , Issue.1-2 , pp. 1-22
    • Shaltiel, R.1
  • 24
    • 65949099639 scopus 로고    scopus 로고
    • Communication lower bounds using dual polynomials
    • Sherstov, A.: Communication lower bounds using dual polynomials. Bulletin of the EATCS 95, 59-93 (2008)
    • (2008) Bulletin of the EATCS , vol.95 , pp. 59-93
    • Sherstov, A.1
  • 27
    • 77953943734 scopus 로고    scopus 로고
    • On quantum-classical equivalence for composed communication problems
    • Sherstov, A.: On quantum-classical equivalence for composed communication problems. Quantum Information and Computation 10 (5- 6), 435-455 (2010)
    • (2010) Quantum. Information and Computation , vol.10 , Issue.5-6 , pp. 435-455
    • Sherstov, A.1
  • 28
    • 66449097372 scopus 로고    scopus 로고
    • Communication complexities of XOR functions
    • Shi, Y., Zhang, Z.: Communication complexities of XOR functions. Quantum information and computation 9 (3- 4), 255-263 (2009)
    • (2009) Quantum. Information and Computation , vol.9 , Issue.3-4 , pp. 255-263
    • Shi, Y.1    Zhang, Z.2
  • 29
    • 66449112197 scopus 로고    scopus 로고
    • Quantum communication complexity of block-composed functions
    • Shi, Y., Zhu, Y.: Quantum communication complexity of block-composed functions. Quantum information and computation 9 (5, 6), 444-460 (2009)
    • (2009) Quantum. Information and Computation , vol.9 , Issue.5-6 , pp. 444-460
    • Shi, Y.1    Zhu, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.