{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:33:08Z","timestamp":1743100388662,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95891-8_28","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T06:19:21Z","timestamp":1232605161000},"page":"291-302","source":"Crossref","is-referenced-by-count":1,"title":["Factoring and Testing Primes in Small Space"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_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., Kayal, N., Saxena, N.: Primes is in\u00a0P. Ann. of Math.\u00a0160, 781\u2013793 (2004)","journal-title":"Ann. of Math."},{"key":"28_CR2","first-page":"61","volume":"74","author":"E. Allender","year":"2001","unstructured":"Allender, E.: The division breakthroughs. Bull. Eur. Assoc. Theoret. Comput. Sci.\u00a074, 61\u201377 (2001)","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Allender, E., Mix Barrington, D.A., Hesse, W.: Uniform circuits for division: Consequences and problems. In: Proc. IEEE Conf. Comput. Complexity, pp. 150\u2013159 (2001)","DOI":"10.1109\/CCC.2001.933882"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-60246-1_137","volume-title":"Mathematical Foundations of Computer Science 1995","author":"A. Bertoni","year":"1995","unstructured":"Bertoni, A., Mereghetti, C., Pighizzini, G.: Strong optimal lower bounds for Turing machines that accept nonregular languages. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 309\u2013318. Springer, Heidelberg (1995)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J.\u00a0Assoc. Comput. Mach.\u00a028, 114\u2013133 (1981)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(86)90112-X","volume":"44","author":"J.H. Chang","year":"1986","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A., Ravikumar, B.: On pebble automata. Theoret. Comput. Sci.\u00a044, 111\u2013121 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(91)90391-E","volume":"80","author":"R. Chang","year":"1991","unstructured":"Chang, R., Hartmanis, J., Ranjan, D.: Space bounded computations: Review and new separation results. Theoret. Comput. Sci.\u00a080, 289\u2013302 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR8","unstructured":"Chiu, A.: Complexity of Parallel Arithmetic Using The Chinese Remainder Representation. Master\u2019s thesis, Univ. Wisconsin-Milwaukee (G.\u00a0Davida, supervisor) (1995)"},{"key":"28_CR9","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\u00a0NC 1. RAIRO Inform. Th\u00e9or. Appl.\u00a035, 259\u2013275 (2001)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1137\/0220048","volume":"20","author":"G.I. Davida","year":"1991","unstructured":"Davida, G.I., Litow, B.: Fast parallel arithmetic via modular representation. SIAM J. Comput.\u00a020, 756\u2013765 (1991)","journal-title":"SIAM J. Comput."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(94)00021-2","volume":"50","author":"P.F. Dietz","year":"1994","unstructured":"Dietz, P.F., Macarie, I.I., Seiferas, J.I.: Bits and relative order from residues, space efficiently. Inform. Process. Lett.\u00a050, 123\u2013127 (1994)","journal-title":"Inform. Process. Lett."},{"key":"28_CR12","volume-title":"Prime Numbers","author":"W. Ellison","year":"1985","unstructured":"Ellison, W., Ellison, F.: Prime Numbers. John Wiley & Sons, Chichester (1985)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0220031","volume":"20","author":"V. Geffert","year":"1991","unstructured":"Geffert, V.: Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Comput.\u00a020, 484\u2013498 (1991)","journal-title":"SIAM J. Comput."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1137\/0222011","volume":"22","author":"K. Iwama","year":"1993","unstructured":"Iwama, K.: ASPACE(o(loglogn)) is regular. SIAM J. Comput.\u00a022, 136\u2013146 (1993)","journal-title":"SIAM J. Comput."},{"key":"28_CR15","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8592-7","volume-title":"A\u00a0Course in Number Theory and Cryptography","author":"N. Koblitz","year":"1994","unstructured":"Koblitz, N.: A\u00a0Course in Number Theory and Cryptography. Graduate Texts in Mathematics, vol.\u00a0114. Springer, Heidelberg (1994)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_135","volume-title":"STACS 94","author":"I.I. Macarie","year":"1994","unstructured":"Macarie, I.I.: Space-efficient deterministic simulation of probabilistic automata. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775. Springer, Heidelberg (1994)"},{"key":"28_CR17","unstructured":"Mereghetti, C.: The descriptional power of sublogarithmic resource bounded Turing machines. In: Proc. Descr. Compl. Formal Syst., pp. 12\u201326. IFIP (2007) (to appear in J.\u00a0Automat. Lang. Combin.)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing Machines with Sublogarithmic Space","author":"A. Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol.\u00a0843. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T03:22:18Z","timestamp":1738898538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}