{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:08Z","timestamp":1760202608408},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_41","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"496-507","source":"Crossref","is-referenced-by-count":3,"title":["Characterizing TC0 in Terms of Infinite Groups"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Krebs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Reifferscheid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D. Barrington","year":"1990","unstructured":"Barrington, D., Immerman, N., Straubing, H.: On uniformity within NC\n                           1. J. Comp. System Sci.\u00a041, 274\u2013306 (1990)","journal-title":"J. Comp. System Sci."},{"key":"41_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Basel (1994)"},{"key":"41_CR3","unstructured":"Schweikardt, N.: On the Expressive Power of First-Order Logic with Built-In Predicates. Dissertation, Universit\u00e4t Mainz (2001)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Ruhl, M.: Counting and addition cannot express deterministic transitive closure. In: Proc. of 14th IEEE Symposium On Logic in Computer Science, pp. 326\u2013334 (1999)","DOI":"10.1109\/LICS.1999.782627"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1006\/jcss.2000.1742","volume":"62","author":"C. Lautemann","year":"2001","unstructured":"Lautemann, C., McKenzie, P., Schwentick, T., Vollmer, H.: The descriptive complexity approach to logcfl. J. Comp. System Sci.\u00a062, 629\u2013652 (2001)","journal-title":"J. Comp. System Sci."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Lange, K.: Some results on majority quantifiers over words. In: Proc. of the 19th IEEE Conference on Computational Complexity, pp. 123\u2013129 (2004)","DOI":"10.1109\/CCC.2004.1313817"},{"key":"41_CR7","volume-title":"Finite Automata","author":"M. Lawson","year":"2004","unstructured":"Lawson, M.: Finite Automata. Chapman & Hall\/CRC, Boca Raton (2004)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:29:50Z","timestamp":1605760190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}