{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:32:53Z","timestamp":1648978373785},"reference-count":13,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1051\/ita:2000107","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:08:17Z","timestamp":1068822497000},"page":"61-75","source":"Crossref","is-referenced-by-count":1,"title":["Construction of Very Hard Functions for Multiparty Communication Complexity"],"prefix":"10.1051","volume":"34","author":[{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,4,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"L. Babai, N. Nisan and M. Szegedy,Multiparty protocols and logspace-hard pseudorandom sequences, Proceedings, 21st ACM STOC (1989).","DOI":"10.1145\/73007.73008"},{"key":"R2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","volume":"28","author":"Blum","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, M.L. Furst and R.J. Lipton,Multi-party protocols, Proceedings, 15th ACM STOC (1983) 94-99.","DOI":"10.1145\/800061.808737"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"D. Dolev and T. Feder,Multiparty communication complexity, Proceedings, 30th IEEE FOCS (1989) 428-433.","DOI":"10.1109\/SFCS.1989.63514"},{"key":"R5","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/0221052","volume":"21","author":"Dolev","year":"1992","journal-title":"SIAM J. Comput."},{"key":"R6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-59042-0_87","volume":"900","author":"Duris","year":"1995","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R7","unstructured":"P. Duris, Multiparty communication complexity and very hard functions (to appear)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"J. Hromkovic,Communication complexity and parallel computing, An EATCS Series. Springer (1997).","DOI":"10.1007\/978-3-662-03442-2"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan,Communication complexity. Cambridge Univ. Press. xiii (1997).","DOI":"10.1017\/CBO9780511574948"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"R.J. Lipton and R. Sedgewick,Lower bounds for VLSI, Proceedings, 13th ACM STOC (1981) 300-307.","DOI":"10.1145\/800076.802482"},{"key":"R11","unstructured":"O.B. Lupanov, Ob odnom metode sinteza skhem (Russian).Izv. Vyssh. Uchebn. Zaved., Radiofizika1(1958) 120-140."},{"key":"R12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Techn. J."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"A.C. Yao,The entropic limitations on VLSI computations, Proceedings, 13th ACM STOC (1981) 308-311.","DOI":"10.1145\/800076.802483"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2000107\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:00:23Z","timestamp":1585263623000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2000107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":13,"journal-issue":{"issue":"1"},"alternative-id":["ita9939"],"URL":"https:\/\/doi.org\/10.1051\/ita:2000107","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}