乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:29:03Z","timestamp":1736573343822,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055830","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"789-797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Communication complexity and lower bounds on multilective computations"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"77_CR1","doi-asserted-by":"crossref","unstructured":"Ableson, H.: Lower bounds on information transfer in distributed computar tions, Proc. 19th IEEE FOCS, IEEE 1978, pp. 151\u2013158.","DOI":"10.1109\/SFCS.1978.22"},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D., Yanakakis, M.: On notions of informations transfer in VLSI circuits, Proc. 15th ACM STOC, ACM 1983, pp. 133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"77_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200404","volume":"3","author":"A. Borodin","year":"1993","unstructured":"Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3 (1993), 1\u201318.","journal-title":"Computational Complexity"},{"key":"77_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/inco.1993.1034","volume":"104","author":"P. \u010furi\u0161","year":"1993","unstructured":"\u010furi\u0161, P., Galil, Z.: On the power of multiple read in chip, Information and Computation 104 (1993), pp. 277\u2013287.","journal-title":"Information and Computation"},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"\u010furi\u0161, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity, Proc. 16th ACM STOC, ACM 1984, pp. 81\u201391.","DOI":"10.1145\/800057.808668"},{"key":"77_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(96)00062-X","volume":"168","author":"M. Dietzfelbinger","year":"1996","unstructured":"Dietzfelbinger, M., Hromkovi\u010d, J., Schnitger, G.: A comparison of two lower bounds methods for communication complexity, Theoretical Computer Science 168 (1996), pp. 39\u201351.","journal-title":"Theoretical Computer Science"},{"key":"77_CR7","doi-asserted-by":"crossref","unstructured":"Gr\u00f6ger, H.D.: A new partition lemma for planar graphs and its application to circuit complexity, In: Proc. FCT'91, Lecture Notes in Computer Science 529, Springer-Verlag 1991, pp. 220\u2013229.","DOI":"10.1007\/3-540-54458-5_66"},{"key":"77_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0890-5401(91)90041-Y","volume":"95","author":"J. Hromkovi\u010d","year":"1992","unstructured":"Hromkovi\u010d, J., Krause, M., Meinel, Ch., Waack, S.: Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits, Information and Computation 95 (1992), pp. 117\u2013128.","journal-title":"Information and Computation"},{"key":"77_CR9","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J.: Communication Complexity and Parallel Computing, EATCS Series, Springer 1997, 336p.","DOI":"10.1007\/978-3-662-03442-2"},{"key":"77_CR10","doi-asserted-by":"crossref","unstructured":"Krause, M., Meinel, Ch., Waack, S.: Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines, In: Proc. Structure in Complexity Theory 1989, pp. 240\u2013249.","DOI":"10.1109\/SCT.1989.41831"},{"key":"77_CR11","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity, Cambridge University Press 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"77_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs, SIAM J. Applied Mathematics 36 (1979), pp. 177\u2013189.","journal-title":"SIAM J. Applied Mathematics"},{"key":"77_CR13","unstructured":"Pudl\u00e1k, P., Z\u00e1k, S.: Space complexity of computations, Tech. Report, Prague 1983."},{"key":"77_CR14","first-page":"152","volume":"3","author":"E.A. Okolnishkova","year":"1993","unstructured":"Okolnishkova, E.A.: On lower bounds for branching programs. Siberian Advances in Mathematics 3 (1993), 152\u2013166.","journal-title":"Siberian Advances in Mathematics"},{"key":"77_CR15","doi-asserted-by":"crossref","unstructured":"Sauerhoff,M.: Lower bounds for randomized read-k-times branching programs. In: Proc. STACS'98, Lecture Notes in Computer Science 1373, pp. 105\u2013115.","DOI":"10.1007\/BFb0028553"},{"key":"77_CR16","unstructured":"Savage, J.E.: Multilective VLSI algorithms, JCSS (1984), pp. 243\u2013273."},{"key":"77_CR17","doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-time complexity for VLSI, Proc. 11th ACM STOC, ACM 1979, pp. 81\u201388.","DOI":"10.1145\/800135.804401"},{"key":"77_CR18","doi-asserted-by":"crossref","unstructured":"Tur\u00e1n, Gy.: On restricted Boolean circuits, In: Proc. FCT'89, Lecture Notes in Computer Science 380, Springer-Verlag 1989, pp. 460\u2013469.","DOI":"10.1007\/3-540-51498-8_45"},{"key":"77_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/42282.46161","volume":"35","author":"I. Wegener","year":"1988","unstructured":"Wegener, I.: On the complexity of branching programs and decision trees for clique funcion, J. of ACM 35 (1988), pp. 461\u2013471.","journal-title":"J. of ACM"},{"key":"77_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing, Proc. 11th ACM STOC, ACM 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"77_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: The entropic limitations on VLSI computations, Proc. 11th ACM STOC, ACM 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:52:30Z","timestamp":1736517150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055830"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0055830","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"28 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}