{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040319,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214001","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"249-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Determinism versus nondeterminism with arithmetic tests and computation"],"prefix":"10.1145","author":[{"given":"Mikl\u00f3s","family":"Ajtai","sequence":"first","affiliation":[{"name":"IBM Alamden Research Center, San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho V.","year":"1974","unstructured":". V. Aho , J.E. Hopcroft , J.D. Ullman , The Design and Analysis of Computer Algorithms , Addison-Wesley , 1974 . .V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1821"},{"key":"e_1_3_2_2_3_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC),17:28","author":"Ajtai M.","year":"2010","unstructured":"M. Ajtai , Oblivious $RAM$s without cryptographic assumptions , Electronic Colloquium on Computational Complexity (ECCC),17:28 , 2010 . M. Ajtai, Oblivious $RAM$s without cryptographic assumptions, Electronic Colloquium on Computational Complexity (ECCC),17:28, 2010."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806716"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/31846.31852"},{"key":"e_1_3_2_2_6_1","volume-title":"Galois Theory","author":"Artin E.","year":"1998","unstructured":"E. Artin . Galois Theory , Dover Publications, 1998 .(Reprinting of second revised edition of 1944, The University of Notre Dame Press) . E. Artin. Galois Theory, Dover Publications, 1998.(Reprinting of second revised edition of 1944, The University of Notre Dame Press)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215070"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1778"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/636865.636867"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/1970289"},{"volume-title":"ICALP 2001:  104--114","author":"Hesse W.","key":"e_1_3_2_2_11_1","unstructured":"W. Hesse , Division is in Uniform $TC^0$ , ICALP 2001: 104--114 . W. Hesse, Division is in Uniform $TC^0$, ICALP 2001: 104--114."},{"key":"e_1_3_2_2_12_1","volume-title":"Differential Galois theory,Notices of the American Mathematical Society 46 (9)","author":"Magid A.","year":"1999","unstructured":"A. Magid , Differential Galois theory,Notices of the American Mathematical Society 46 (9) : 1999 . A. Magid, Differential Galois theory,Notices of the American Mathematical Society 46 (9): 1999."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1671"},{"key":"e_1_3_2_2_14_1","first-page":"279","article-title":"Matijasevic, Enumerable sets are diophantine","volume":"191","author":"Ju.","year":"1970","unstructured":"Ju. V . Matijasevic, Enumerable sets are diophantine , Dokl. Akad.Nauk SSSR 191 ( 1970 ), 279 -- 282 . English transi.: Soviet Math. Doklady11 (1970), 354--358. Ju. V. Matijasevic, Enumerable sets are diophantine, Dokl. Akad.Nauk SSSR 191 (1970), 279--282. English transi.: Soviet Math. Doklady11 (1970), 354--358.","journal-title":"Dokl. Akad.Nauk SSSR"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.39"},{"volume-title":"Studies in Logic and the Foundations of Mathematics","year":"1987","key":"e_1_3_2_2_16_1","unstructured":". Takeuti , Proof Theory,North-Holland , Studies in Logic and the Foundations of Mathematics , Vol. 81 , Second edition, 1987 . . Takeuti, Proof Theory,North-Holland, Studies in Logic and the Foundations of Mathematics, Vol. 81, Second edition, 1987."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.49"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214001","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214001"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":17,"alternative-id":["10.1145\/2213977.2214001","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214001","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}