{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:20:22Z","timestamp":1649193622811},"publisher-location":"Wiesbaden","reference-count":10,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"value":"9783815420331","type":"print"},{"value":"9783322952332","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_10","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:17:04Z","timestamp":1366175824000},"page":"169-183","source":"Crossref","is-referenced-by-count":0,"title":["\u00dcber den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Halstenberg","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"151","volume-title":"Lower bounds on information transfer in distributed computations","author":"H Abelson","year":"1978","unstructured":"H. Abelson, Lower bounds on information transfer in distributed computations Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 151\u2013158, 1978"},{"key":"10_CR2","first-page":"133","volume-title":"On notions of information transfer in VLSI circuits","author":"AV Aho","year":"1983","unstructured":"A. V. Aho, J. D. Ullman, M. Yannakakis, On notions of information transfer in VLSI circuits Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 133\u2013139, 1983"},{"key":"10_CR3","first-page":"337","volume-title":"Complexity classes in communication complexity","author":"L Babai","year":"1986","unstructured":"L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 337\u2013347, 1986"},{"key":"10_CR4","volume-title":"PP is closed under intersection","author":"R Beigel","year":"1990","unstructured":"R. Beigel, N. Reingold, D. Spielman, PP is closed under intersection, Technischer Bericht YALEU\/DCS\/ TR-803, Yale University, 1990"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(90)90027-I","volume":"41","author":"B Halstenberg","year":"1990","unstructured":"B. Halstenberg, R. Reischuk, Relations between communication complexity classes Journal of Computer and System Sciences 41 (1990), 402\u2013429, Academic Press","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR6","first-page":"539","volume-title":"Monotone circuits for connectivity require super-logarithmic depth","author":"M Karchmer","year":"1988","unstructured":"M. Karchmer, A. Wigderson, Monotone circuits for connectivity require super-logarithmic depth Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 539\u2013550, 1988"},{"key":"10_CR7","first-page":"300","volume-title":"Lower bounds for VLSI","author":"RJ Lipton","year":"1981","unstructured":"R. J. Lipton, R. Sedgewick, Lower bounds for VLSI Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 300\u2013307, 1981"},{"key":"10_CR8","volume-title":"PP is-hard for the polynomial-time hierarchy","author":"S Toda","year":"1989","unstructured":"S. Toda, PP is-hard for the polynomial-time hierarchy, Technischer Bericht, Tokyo University of Electro-communications, Tokio, 1989"},{"key":"10_CR9","first-page":"209","volume-title":"Some complexity questions related to distributed computing","author":"AC Yao","year":"1979","unstructured":"A. C. Yao, Some complexity questions related to distributed computing Proceedings of the 11th Annual ACM Symposium on Theory of Computing, 209\u2013213, 1979"},{"key":"10_CR10","first-page":"383","volume-title":"Probabilistic quantifiers, adversaries, and complexity classes: an overview","author":"S Zachos","year":"1986","unstructured":"S. Zachos, Probabilistic quantifiers, adversaries, and complexity classes: an overview Proceedings Structure in Complexity Theory 1st Annual Conference, 383\u2013400, 1986"}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T10:19:36Z","timestamp":1557656376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":10,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-322-95233-2_10","relation":{},"ISSN":["1615-4584"],"issn-type":[{"value":"1615-4584","type":"print"}],"published":{"date-parts":[[1992]]}}}