메뉴 건너뛰기




Volumn 33, Issue 1, 2003, Pages 137-166

Communication complexity of simultaneous messages

Author keywords

Circuit complexity; Communication complexity; Group theory; Lower bounds

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; GAME THEORY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

EID: 12144289151     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700375944     Document Type: Article
Times cited : (70)

References (35)
  • 1
    • 0002970176 scopus 로고
    • 1-formulae on finite structures
    • 1-formulae on finite structures, Ann. Pure Appl. Logic, 24 (1983), pp. 1-48.
    • (1983) Ann. Pure Appl. Logic , vol.24 , pp. 1-48
    • Ajtai, M.1
  • 5
    • 0040553020 scopus 로고
    • Representation of group elements as short products
    • L. Babai and P. Erdös, Representation of group elements as short products, Ann. Discrete Math., 12 (1982), pp. 21-26.
    • (1982) Ann. Discrete Math. , vol.12 , pp. 21-26
    • Babai, L.1    Erdös, P.2
  • 6
    • 0039304089 scopus 로고    scopus 로고
    • The cost of the missing bit: Communication complexity with help
    • L. Babai, T. Hayes and P. Kimmel, The cost of the missing bit: Communication complexity with help, Combinatorica, 21 (2001), pp. 455-488.
    • (2001) Combinatorica , vol.21 , pp. 455-488
    • Babai, L.1    Hayes, T.2    Kimmel, P.3
  • 8
    • 0026940019 scopus 로고
    • Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs
    • L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs, J. Comput. System Sci., 45 (1992), pp. 204-232.
    • (1992) J. Comput. System Sci. , vol.45 , pp. 204-232
    • Babai, L.1    Nisan, N.2    Szegedy, M.3
  • 15
    • 0002127588 scopus 로고
    • Parity, circuits, and the polynomial time hierarchy
    • M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial time hierarchy, Math. Systems Theory, 17 (1984), pp. 13-27.
    • (1984) Math. Systems Theory , vol.17 , pp. 13-27
    • Furst, M.1    Saxe, J.2    Sipser, M.3
  • 16
    • 38149146834 scopus 로고
    • The BNS lower bound for multi-party protocols is nearly optimal
    • V. Grolmusz, The BNS lower bound for multi-party protocols is nearly optimal, Inform. and Comput., 112 (1994), pp. 51-54.
    • (1994) Inform. and Comput. , vol.112 , pp. 51-54
    • Grolmusz, V.1
  • 17
    • 0001295178 scopus 로고
    • On the power of small-depth threshold circuits
    • J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, Comput. Complexity, 1 (1991), pp. 113-129.
    • (1991) Comput. Complexity , vol.1 , pp. 113-129
    • Håstad, J.1    Goldmann, M.2
  • 20
    • 0039363674 scopus 로고
    • On H-bases and H-decompositions of finite solvable and alternating groups
    • G. Kozma and A. Lev, On H-bases and H-decompositions of finite solvable and alternating groups, J. Number Theory, 49 (1994), 385-391.
    • (1994) J. Number Theory , vol.49 , pp. 385-391
    • Kozma, G.1    Lev, A.2
  • 23
    • 0003625461 scopus 로고    scopus 로고
    • Private access to distributed information
    • Masters thesis, Technion, Haifa, Israel
    • E. Mann, Private Access to Distributed Information, Masters thesis, Technion, Haifa, Israel, 1998.
    • (1998)
    • Mann, E.1
  • 24
    • 38149074447 scopus 로고
    • The computational complexity of universal hashing
    • Y. Mansour, N. Nisan, and P. Tiwari, The computational complexity of universal hashing, Theoret. Comput. Sci., 107 (1993), pp. 121-133.
    • (1993) Theoret. Comput. Sci. , vol.107 , pp. 121-133
    • Mansour, Y.1    Nisan, N.2    Tiwari, P.3
  • 25
    • 0027543090 scopus 로고
    • Rounds in communication complexity revisited
    • N. Nisan and A. Wigderson, Rounds in communication complexity revisited, SIAM J. Comput., 22 (1993), pp. 211-219.
    • (1993) SIAM J. Comput. , vol.22 , pp. 211-219
    • Nisan, N.1    Wigderson, A.2
  • 27
    • 0000362179 scopus 로고    scopus 로고
    • Boolean circuits, tensor ranks, and communication complexity
    • P. Pudlák, V. Rödl, and J. Sgall, Boolean circuits, tensor ranks, and communication complexity, SIAM J. Comput., 26 (1997), pp. 605-633.
    • (1997) SIAM J. Comput. , vol.26 , pp. 605-633
    • Pudlák, P.1    Rödl, V.2    Sgall, J.3
  • 28
    • 26744471682 scopus 로고    scopus 로고
    • On the rohrbach conjecture
    • private communication
    • L. Pyber, On the Rohrbach Conjecture, private communication.
    • Pyber, L.1
  • 29
    • 0000347859 scopus 로고
    • Ω(log n) lower bounds on the size of depth 3 circuits with AND gates at the bottom
    • Ω(log n) lower bounds on the size of depth 3 circuits with AND gates at the bottom, Inform. Process. Lett., 45 (1993), pp. 303-307.
    • (1993) Inform. Process. Lett. , vol.45 , pp. 303-307
    • Razborov, A.1    Wigderson, A.2
  • 30
    • 34250973727 scopus 로고
    • Ein Beitrag zur additiven Zahlentheorie, Math. Z.
    • H. Rohrbach, Ein Beitrag zur additiven Zahlentheorie, Math. Z., 42 (1937), pp. 1-30.
    • (1937) , vol.42 , pp. 1-30
    • Rohrbach, H.1
  • 31
    • 0040549010 scopus 로고
    • Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frage
    • H. Rohrbach, Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frage, Math. Z., 42 (1937), pp. 538-542.
    • (1937) Math. Z. , vol.42 , pp. 538-542
    • Rohrbach, H.1
  • 32
    • 0003215121 scopus 로고
    • Equations over finite fields: An elementary approach
    • Springer, Berlin
    • W. M. Schmidt, Equations over Finite Fields: An Elementary Approach, Lecture Notes in Math. 536, Springer, Berlin, 1976.
    • (1976) Lecture Notes in Math. , vol.536
    • Schmidt, W.M.1


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