{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:39:50Z","timestamp":1725745190303},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399916"},{"type":"electronic","value":"9783642399923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39992-3_8","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T06:08:18Z","timestamp":1376460498000},"page":"49-63","source":"Crossref","is-referenced-by-count":0,"title":["First Order Extensions of Residue Classes and Uniform Circuit Complexity"],"prefix":"10.1007","author":[{"given":"Argimiro","family":"Arratia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos E.","family":"Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1970438","volume":"85","author":"J. Ax","year":"1967","unstructured":"Ax, J.: Solving diophantine problems modulo every prime. Ann. of Math.\u00a085(2), 161\u2013183 (1967)","journal-title":"Ann. of Math."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.2307\/1970573","volume":"88","author":"J. Ax","year":"1968","unstructured":"Ax, J.: The elementary theory of finite fields. Ann. of Math.\u00a088(2), 239\u2013271 (1968)","journal-title":"Ann. of Math."},{"key":"8_CR3","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 NC1. J. Computer and Syst. Sci.\u00a041, 274\u2013306 (1990)","journal-title":"J. Computer and Syst. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Boppana, R., Sipser, M.: The complexity of finite functions. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 757\u2013804. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"Borodin, A.: On relating time and space to size and depth. SIAM J. Comput.\u00a06(4), 733\u2013744 (1977)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer (1995)","DOI":"10.1007\/3-540-28788-4"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1073\/pnas.94.4.1054","volume":"94","author":"J. Friedlander","year":"1997","unstructured":"Friedlander, J., Iwaniec, H.: Using a parity-sensitive sieve to count prime values of a polynomial. Proc. Natl. Acad. Sci. USA\u00a094, 1054\u20131058 (1997)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Descriptive Complexity. Springer (1998)","DOI":"10.1007\/978-1-4612-0539-5"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.2307\/2317521","volume":"78","author":"I. Gerst","year":"1971","unstructured":"Gerst, I., Brillhart, J.: On the prime divisors of polynomials. American Math. Monthly\u00a078(3), 250\u2013266 (1971)","journal-title":"American Math. Monthly"},{"issue":"2","key":"8_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1215\/ijm\/1256046492","volume":"27","author":"J.C. Lagarias","year":"1983","unstructured":"Lagarias, J.C.: Sets of primes determined by systems of polynomial congruences. Illinois J. Math.\u00a027(2), 224\u2013239 (1983)","journal-title":"Illinois J. Math."},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"571","DOI":"10.2307\/2317083","volume":"79","author":"B.F. Wyman","year":"1972","unstructured":"Wyman, B.F.: What is a Reciprocity Law? American Math. Monthly\u00a079(6), 571\u2013586 (1972)","journal-title":"American Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39992-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:51:47Z","timestamp":1558007507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39992-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399916","9783642399923"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39992-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}