{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:24Z","timestamp":1725558804906},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_17","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:53:34Z","timestamp":1277499214000},"page":"171-182","source":"Crossref","is-referenced-by-count":3,"title":["Circuits on Cylinders"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Vinay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. System Sci.\u00a038(1), 150\u2013164 (1989)","journal-title":"J. Comput. System Sci."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: Searching constant width mazes captures the AC0 hierarchy. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 73\u201383 (1998)","DOI":"10.1007\/BFb0028550"},{"key":"17_CR3","first-page":"24","volume-title":"14th Annual IEEE Conference on Computational Complexity","author":"D.A.M. Barrington","year":"1999","unstructured":"Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: 14th Annual IEEE Conference on Computational Complexity, pp. 24\u201331. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D.A.M. Barrington","year":"1988","unstructured":"Barrington, D.A.M., Th\u00e9rien, D.: Finite monoids and the fine structure of NC1. Journal of the ACM (JACM)\u00a035(4), 941\u2013952 (1988)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1137\/S0097539798340850","volume":"29","author":"V. Grolmusz","year":"2000","unstructured":"Grolmusz, V., Tardos, G.: Lower bounds for (modp \u2212 modm) circuits. SIAM Journal on Computing\u00a029(4), 1209\u20131222 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hansen, K.A.: Constant width planar computation characterizes ACC0. Technical Report 25, Electronic Colloquium on Computational Complexity (2003)","DOI":"10.1007\/978-3-540-24749-4_5"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Miltersen, P.B., Vinay, V.: Circuits on cylinders. Technical Report 66, Electronic Colloquium on Computational Complexity (2002)","DOI":"10.7146\/brics.v9i50.21765"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/3149.3158","volume":"32","author":"S. Skyum","year":"1985","unstructured":"Skyum, S., Valiant, L.G.: A complexity theory based on boolean algebra. Journal of the ACM (JACM)\u00a032(2), 484\u2013502 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"17_CR9","first-page":"108","volume-title":"11th Annual IEEE Conference on Computational Complexity","author":"V. Vinay","year":"1996","unstructured":"Vinay, V.: Hierarchies of circuit classes that are closed under complement. In: 11th Annual IEEE Conference on Computational Complexity, pp. 108\u2013117. IEEE Computer Society Press, Los Alamitos (1996)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:53:37Z","timestamp":1559220817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}