{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:40Z","timestamp":1725468520178},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055829","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"780-788","source":"Crossref","is-referenced-by-count":1,"title":["On Boolean vs. Modular arithmetic for circuits and communication protocols"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Damm","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"76_CR1","unstructured":"Amos Beimel and Anna G\u00e1l. On arithmetic branching programs. Proc. Conf. on Computational Complexity, 1998 (Preliminary version: Technical Report 97-81, Center for Discrete Mathematics and Theoretical Computer Science 1997)"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Carsten Damm, Matthias Krause, Christoph Meinel, and Stephan Waack. On Relations Between Counting Communication Complexity Classes. Journal on Computer System Sciences (to appear).","DOI":"10.1016\/j.jcss.2004.03.002"},{"key":"76_CR3","unstructured":"Anna G\u00e1l and Avi Wigderson. Boolean complexity classes vs. their arithmetic analogs. Random Structures and Algorithms. John Wiley & Sons, Inc., 1996. see also: Electronic Colloquium on Computational Complexity, Report 95-49, http:\/\/www.eccc.uni-trier.de\/eccc\/, 1995."},{"key":"76_CR4","unstructured":"Avi Wigderson. NL\/poly\n\n                  \n                    \n                  \n                  \n$$\\subseteq$$\n\n                 \u2295L\/poly. Proc. of the 9th Conference on Structure in Complexity Theory, pp. 59\u201362, 1994."},{"key":"76_CR5","unstructured":"Rudolf Lidl and Harald Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1986."},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. In Proceedings of the 19th STOC, pages 345\u2013354, 1987.","DOI":"10.1145\/28395.383347"},{"key":"76_CR8","unstructured":"Klaus Reinhardt and Eric Allender. Making nondeterminism unambigous. Electronic Colloquium on Computational Complexity, Report 97-14, http:\/\/www.eccc.uni-trier.de\/eccc\/, 1997."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:01:38Z","timestamp":1549908098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0055829","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}