{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:52Z","timestamp":1725511792601},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_41","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"477-488","source":"Crossref","is-referenced-by-count":4,"title":["Arithmetizing Classes Around NC 1 and L"],"prefix":"10.1007","author":[{"given":"Nutan","family":"Limaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meena","family":"Mahajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. V. Raghavendra","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"41_CR1","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jcss.1999.1675","volume":"60","author":"M. Agrawal","year":"2000","unstructured":"Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. Journal of Computer and System Sciences\u00a060(2), 395\u2013421 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR2","unstructured":"Allender, E.: The division breakthroughs. BEATCS: Bulletin of the European Association for Theoretical Computer Science\u00a074 (2001)"},{"key":"41_CR3","unstructured":"Allender, E.: Arithmetic circuits and counting complexity classes. In: Complexity of Computations and Proofs. Quaderni di Matematica, vol.\u00a013, pp. 33\u201372 (2004)"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)00227-2","volume":"209","author":"E. Allender","year":"1998","unstructured":"Allender, E., et al.: Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theoretical Computer Science\u00a0209, 47\u201386 (1998)","journal-title":"Theoretical Computer Science"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"1","key":"41_CR6","first-page":"150","volume":"38","author":"D. Barrington","year":"1989","unstructured":"Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. JCSS\u00a038(1), 150\u2013164 (1989)","journal-title":"JCSS"},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1137\/0218038","volume":"18","author":"A. Borodin","year":"1989","unstructured":"Borodin, A., et al.: Two applications of inductive counting for complementation problems. SIAM Journal of Computation\u00a018(3), 559\u2013578 (1989)","journal-title":"SIAM Journal of Computation"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","volume-title":"Foundations of Computation Theory","author":"B.V. Braunmuhl","year":"1983","unstructured":"Braunmuhl, B.V., Verbeek, R.: Input-driven languages are recognized in log n space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 40\u201351. Springer, Heidelberg (1983)"},{"issue":"4","key":"41_CR9","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/0221046","volume":"21","author":"S. Buss","year":"1992","unstructured":"Buss, S., et al.: An optimal parallel algorithm for formula evaluation. SIAM J. Comput.\u00a021(4), 755\u2013780 (1992)","journal-title":"SIAM J. Comput."},{"key":"41_CR10","first-page":"200","volume":"57","author":"H. Caussinus","year":"1998","unstructured":"Caussinus, H., et al.: Nondeterministic NC1 computation. JCSS\u00a057, 200\u2013212 (1998)","journal-title":"JCSS"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ita:2001119","volume":"35","author":"A. Chiu","year":"2001","unstructured":"Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform NC1. RAIRO Theoretical Informatics and Applications\u00a035, 259\u2013276 (2001)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Deterministic CFL\u2019s are accepted simultaneously in polynomial time and log squared space. In: STOC, pp. 338\u2013345 (1979)","DOI":"10.1145\/800135.804426"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(89)90009-6","volume":"80","author":"P. Dymond","year":"1989","unstructured":"Dymond, P., Cook, S.: Complexity theory of parallel time and hardware. Information and Computation\u00a080, 205\u2013226 (1989)","journal-title":"Information and Computation"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(88)90148-2","volume":"26","author":"P.W. Dymond","year":"1988","unstructured":"Dymond, P.W.: Input-driven languages are in logn depth. Information Processing Letters\u00a026, 247\u2013250 (1988)","journal-title":"Information Processing Letters"},{"key":"41_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-62034-6_57","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"H. Fernau","year":"1996","unstructured":"Fernau, H., Lange, K.-J., Reinhardt, K.: Advocating ownership. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 286\u2013297. Springer, Heidelberg (1996)"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(94)00036-0","volume":"50","author":"S. Istrail","year":"1994","unstructured":"Istrail, S., Zivkovic, D.: Bounded width polynomial size Boolean formulas compute exactly those functions in AC0 . Infor. Proc. Letters\u00a050, 211\u2013216 (1994)","journal-title":"Infor. Proc. Letters"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 67\u2013161 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","volume-title":"Automata, Languages and Programming","author":"K. Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 422\u2013432. Springer, Heidelberg (1980)"},{"issue":"2","key":"41_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/inco.1995.1064","volume":"118","author":"R. Niedermeier","year":"1995","unstructured":"Niedermeier, R., Rossmanith, P.: Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Inform. and Comp.\u00a0118(2), 227\u2013245 (1995)","journal-title":"Inform. and Comp."},{"issue":"11","key":"41_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01205052","volume":"4","author":"N. Nisan","year":"1994","unstructured":"Nisan, N.: RL \u2286 SC. Computational Complexity\u00a04(11), 1\u201311 (1994)","journal-title":"Computational Complexity"},{"key":"41_CR21","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W. Ruzzo","year":"1980","unstructured":"Ruzzo, W.: Tree-size bounded alternation. Journal of Computer and System Sciences\u00a021, 218\u2013235 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S. Cook","year":"1971","unstructured":"Cook, S.: Characterizations of pushdown machines in terms of time-bounded computers. Journal of Assoc. Comput. Mach.\u00a018, 4\u201318 (1971)","journal-title":"Journal of Assoc. Comput. Mach."},{"issue":"3","key":"41_CR23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I. Sudborough","year":"1978","unstructured":"Sudborough, I.: On the tape complexity of deterministic context-free language. Journal of Association of Computing Machinery\u00a025(3), 405\u2013414 (1978)","journal-title":"Journal of Association of Computing Machinery"},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","volume":"42","author":"H. Venkateswaran","year":"1991","unstructured":"Venkateswaran, H.: Properties that characterize LogCFL. Journal of Computer and System Sciences\u00a042, 380\u2013404 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Proc. Structure in Complexity Theory Conference, pp. 270\u2013284 (1991)","DOI":"10.1109\/SCT.1991.160269"},{"key":"41_CR26","first-page":"108","volume-title":"Proc. 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: Proc. 11th Annual IEEE Conference on Computational Complexity, pp. 108\u2013117. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"41_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, New York (1999)"},{"issue":"1","key":"41_CR28","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(91)90078-G","volume":"91","author":"J. Gathen von zur","year":"1991","unstructured":"von zur Gathen, J., Seroussi, G.: Boolean circuits versus arithmetic circuits. Information and Computation\u00a091(1), 142\u2013154 (1991)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:55Z","timestamp":1605762715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_41","relation":{},"subject":[]}}