{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:46Z","timestamp":1725493486982},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664086"},{"type":"electronic","value":"9783540483403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:04:52Z","timestamp":1184605492000},"page":"160-169","source":"Crossref","is-referenced-by-count":1,"title":["Multiparty Communication Complexity: Very Hard Functions"],"prefix":"10.1007","author":[{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Nisan, N., Szegedy, M., Multiparty protocols and logspace-hard pseudorandom sequences, Proceedings, 21st ACM STOC, 1\u20131, 1989.","DOI":"10.1145\/73007.73008"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Chandra, A. K., Furst, M.L., Lipton, R. J., Multi-party protocols, Proceedings, 15th ACM STOC, 94\u201399, 1983.","DOI":"10.1145\/800061.808737"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feder, T., Multiparty communication complexity, Proceedings, 30th IEEE FOCS, 428\u2013433, 1989.","DOI":"10.1109\/SFCS.1989.63514"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/0221052","volume":"21","author":"D. Dolev","year":"1992","unstructured":"Dolev, D., Feder, T., Determinism vs. nondeterminism in multiparty communication complexity, SIAM Journal Computing 21, 889\u2013893, 1992. Proceedings, 30th IEEE FOCS, 428\u2013433, 1989.","journal-title":"SIAM Journal Computing"},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-59042-0_87","volume-title":"STACS\u201995","author":"P. \u010euri\u0161","year":"1995","unstructured":"\u010euri\u0161, P., Rolim J.D.P., A lower bound on the multiparty communication complexity, STACS\u201995, LNCS 900, Springer-Verlag, 350\u2013360, 1995."},{"key":"15_CR6","unstructured":"\u010euri\u0161, P., Multiparty communication complexity and very hard functions, 1999 (to appear)."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Communication complexity and parallel computing, An EATCS Series, Springer, 1997.","DOI":"10.1007\/978-3-662-03442-2"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N., Communication complexity, Cambridge Univ. Press. xiii, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ma\u0148uch, J., Multiparty Communication Complexity: Very Hard Functions, TUCS Report 282, 1999.","DOI":"10.1007\/3-540-48340-3_15"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:55:22Z","timestamp":1556682922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}