{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:59Z","timestamp":1725490439066},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_14","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"134-145","source":"Crossref","is-referenced-by-count":3,"title":["Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity"],"prefix":"10.1007","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matei","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toniann","family":"Pitassi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory (preliminary version). In: FOCS27th, pp. 337\u2013347 (1986)","DOI":"10.1109\/SFCS.1986.15"},{"key":"14_CR2","first-page":"137","volume":"33","author":"L. Babai","year":"2004","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SJCOMP\u00a033, 137\u2013166 (2004)","journal-title":"SJCOMP"},{"key":"14_CR3","first-page":"204","volume":"45","author":"L. Babai","year":"1992","unstructured":"Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. JCSS\u00a045, 204\u2013232 (1992)","journal-title":"JCSS"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Beame, P., Pitassi, T., Segerlind, N.: Lower bounds for lov\u00e1sz-schrijver systems and beyond follow from multiparty communication complexity. In: ICALP 32nd, pp. 1176\u20131188 (2005)","DOI":"10.1007\/11523468_95"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Beigel, R., Gasarch, W., Glenn, J.: The multiparty communication complexity of Exact-T: Improved bounds and new problems. In: MFCS31st, pp. 146\u2013156 (2006)","DOI":"10.1007\/11821069_13"},{"key":"14_CR6","unstructured":"Beigel, R., Tarui, J.: On ACC. In: FOCS 32nd, pp. 783\u2013792 (1991)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: STOC 15th, pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"key":"14_CR8","first-page":"110","volume":"6","author":"F.R.K. Chung","year":"1993","unstructured":"Chung, F.R.K., Tetali, P.: Communication complexity and quasi randomness. SIAMDM\u00a06, 110\u2013125 (1993)","journal-title":"SIAMDM"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ford, J., G\u00e1l, A.: Hadamard tensors and lower bounds on multiparty communication complexity. In: ICALP 32nd, pp. 1163\u20131175 (2005)","DOI":"10.1007\/11523468_94"},{"key":"14_CR10","first-page":"113","volume":"1","author":"J. H\u00e5stad","year":"1991","unstructured":"H\u00e5stad, J., Goldmann, M.: On the power of small-depth threshold circuits. CompCompl\u00a01, 113\u2013129 (1991)","journal-title":"CompCompl"},{"key":"14_CR11","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. TCS\u00a0107, 121\u2013133 (1993)","journal-title":"TCS"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. IPL\u00a039, 67\u201371 (1991)","journal-title":"IPL"},{"key":"14_CR14","unstructured":"Nisan, N.: The communication complexity of threshold gates. In: Proceedings of Combinatorics, Paul Erdos is Eighty, pp. 301\u2013315 (1993)"},{"key":"14_CR15","first-page":"211","volume":"22","author":"N. Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SJCOMP\u00a022, 211\u2013219 (1993)","journal-title":"SJCOMP"},{"key":"14_CR16","first-page":"113","volume":"9","author":"R. Raz","year":"2000","unstructured":"Raz, R.: The BNS-Chung criterion for multi-party communication complexity. CompCompl\u00a09, 113\u2013122 (2000)","journal-title":"CompCompl"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 11th, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:10:58Z","timestamp":1619518258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}