{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:54:30Z","timestamp":1743022470088,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780342_8","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"75-84","source":"Crossref","is-referenced-by-count":0,"title":["Logspace Complexity of Functions and Structures"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zia","family":"Uddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayhal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics\u00a0160, 781\u2013793 (2004)","journal-title":"Annals of Mathematics"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"P.W. Beame","year":"1986","unstructured":"Beame, P.W., Cook, S.A., Hoover, H.J.: Log depth circuits for division and related problems. SIAM J. Computing\u00a015, 994\u20131003 (1986)","journal-title":"SIAM J. Computing"},{"unstructured":"Calvert, W., Cenzer, D., Harizanov, V., Morozov, A.: $\\Delta^0_2$ categoricity of equivalence structures. Ann. Pure Appl. Logic (to appear)","key":"8_CR3"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"D. Cenzer","year":"1991","unstructured":"Cenzer, D., Remmel, J.B.: Polynomial-time versus recursive models. Ann. Pure Appl. Logic\u00a054, 17\u201358 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"D. Cenzer","year":"1992","unstructured":"Cenzer, D., Remmel, J.B.: Polynomial-time Abelian groups. Ann. Pure Appl. Logic\u00a056, 313\u2013363 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"8_CR6","series-title":"Prog. in Comp. Science and Appl. Logic","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-1-4612-2566-9_5","volume-title":"Feasible Mathematics II","author":"D. Cenzer","year":"1995","unstructured":"Cenzer, D., Remmel, J.B.: Feasibly categorical Abelian groups. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II. Prog. in Comp. Science and Appl. Logic, vol.\u00a013, pp. 91\u2013154. Birkh\u00e4user, Basel (1995)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-60178-3_91","volume-title":"Logic and Computational Complexity","author":"D. Cenzer","year":"1995","unstructured":"Cenzer, D., Remmel, J.B.: Feasibly categorical models. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 300\u2013312. Springer, Heidelberg (1995)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1997.2676","volume":"140","author":"D. Cenzer","year":"1998","unstructured":"Cenzer, D., Remmel, J.B.: Complexity and categoricity. Information and Computation\u00a0140, 2\u201325 (1998)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Cenzer, D., Remmel, J.B.: Complexity-theoretic model theory and algebra. In: Ershov, Y., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics. Elsevier Studies in Logic and Found. Math., vol.\u00a0I, 138, pp. 381\u2013513 (1998)","key":"8_CR9","DOI":"10.1016\/S0049-237X(98)80011-6"},{"key":"8_CR10","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 NC 1. Theor. Inform. Appl.\u00a035, 259\u2013275 (2001)","journal-title":"Theor. Inform. Appl."},{"key":"8_CR11","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)"},{"unstructured":"The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, London, UK (1998)","key":"8_CR12"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0168-0072(89)90047-X","volume":"44","author":"A. Nerode","year":"1989","unstructured":"Nerode, A., Remmel, J.B.: Complexity-theoretic algebra II: Boolean algebras. Ann. Pure Appl. Logic\u00a044, 71\u201379 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"doi-asserted-by":"crossref","unstructured":"Nerode, A., Remmel, J.B.: Polynomial time equivalence types. In: Sieg, W. (ed.) Logic and Computation. Contemp. Math., vol.\u00a0106, pp. 221\u2013249 (1990)","key":"8_CR14","DOI":"10.1090\/conm\/106\/1057825"},{"doi-asserted-by":"crossref","unstructured":"Nerode, A., Remmel, J.B.: Polynomially isolated sets. In: Ambos-Spies, K., Muller, G.H., Sacks, G.E. (eds.) Recursion Theory Week (Oberwolfach 1989). Lecture Notes in Math., vol.\u00a01432, pp. 323\u2013362. Springer, Heidelberg (1990)","key":"8_CR15","DOI":"10.1007\/BFb0086125"},{"key":"8_CR16","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1995)"},{"key":"8_CR17","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BFb0090954","volume-title":"Two theorems on autostability in p-groups, Logic Year 1979-80 (Storrs, CT)","author":"R. Smith","year":"1981","unstructured":"Smith, R.: Two theorems on autostability in p-groups, Logic Year 1979-80 (Storrs, CT). Lecture Notes in Math., vol.\u00a0859, pp. 302\u2013311. Springer, Berlin (1981)"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T13:00:44Z","timestamp":1555678844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11780342_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}