{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T06:23:37Z","timestamp":1778135017658,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0747-7171(02)00140-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:09:52Z","timestamp":1049508592000},"page":"403-419","source":"Crossref","is-referenced-by-count":90,"title":["Modular algorithms for computing Gr\u00f6bner bases"],"prefix":"10.1016","volume":"35","author":[{"given":"Elizabeth A.","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(02)00140-2_B1","series-title":"An Introduction to Gr\u00f6bner Bases","author":"Adams","year":"1994"},{"key":"10.1016\/S0747-7171(02)00140-2_B2","unstructured":"Arnold, E.A., 2000. Computing Gr\u00f6bner Bases with Hilbert Lucky Primes, Ph.D. Dissertation, University of Maryland, College Park, MD"},{"key":"10.1016\/S0747-7171(02)00140-2_B3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1090\/S0025-5718-1966-0187379-1","article-title":"Exact solutions of linear equations with rational coefficients by congruence techniques","volume":"20","author":"Borosh","year":"1966","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S0747-7171(02)00140-2_B4","doi-asserted-by":"crossref","unstructured":"Buchberger, B., 1979. A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner-bases, Lecture Notes in Computer Science, vol. 72, pp. 23\u201321","DOI":"10.1007\/3-540-09519-5_52"},{"key":"10.1016\/S0747-7171(02)00140-2_B5","doi-asserted-by":"crossref","unstructured":"Buchberger, B., 1985. Gr\u00f6bner-bases: an algorithmic method in polynomial ideal theory, In: Multidimensional Systems Theory, pp. 184\u2013232","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"10.1016\/S0747-7171(02)00140-2_B6","unstructured":"Capani, A., Niesi, G., Robbiano, L., 2001. CoCoA, a system for doing Computations in Commutatative Algebra. Available via anonymous ftp from cocoa.dima.unige.it, ed. 4.1"},{"key":"10.1016\/S0747-7171(02)00140-2_B7","series-title":"Computer Algebra: Systems and algorithms for algebraic computation","author":"Davenport","year":"1988"},{"key":"10.1016\/S0747-7171(02)00140-2_B8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1089330.1089336","article-title":"Some comments on the modular approach to Gr\u00f6bner-bases","volume":"17","author":"Ebert","year":"1983","journal-title":"ACM SIGSAM Bulletin"},{"key":"10.1016\/S0747-7171(02)00140-2_B9","series-title":"Commutative Algebra with a view toward Algebraic Geometry","author":"Eisenbud","year":"1995"},{"key":"10.1016\/S0747-7171(02)00140-2_B10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","article-title":"On an installation of Buchberger\u2019s algorithm","volume":"6","author":"Gebauer","year":"1988","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(02)00140-2_B11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jsco.1993.1014","article-title":"On lucky primes","volume":"15","author":"Gr\u00e4be","year":"1994","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(02)00140-2_B12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01937322","article-title":"Mapping integers and Hensel codes onto Farey fractions","volume":"23","author":"Kornerup","year":"1983","journal-title":"Bit"},{"key":"10.1016\/S0747-7171(02)00140-2_B13","unstructured":"Grayson, D., Stillman, M., 2000. Macaulay 2, Available via anonymous ftp from ftp.math.uiuc.edu, ed. 0.8.60"},{"key":"10.1016\/S0747-7171(02)00140-2_B14","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, H.M., Mora, F., 1984. Upper and lower bounds for the degree of Groebner bases, Eurosam \u201984, Lecture Notes in Computer Science, vol. 174, pp. 172\u2013183","DOI":"10.1007\/BFb0032840"},{"key":"10.1016\/S0747-7171(02)00140-2_B15","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0747-7171(92)90018-Y","article-title":"On lucky ideals for Gr\u00f6bner basis computations","volume":"14","author":"Pauer","year":"1992","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(02)00140-2_B16","first-page":"371","article-title":"A modular method for Gr\u00f6bner-basis construction over Q and solving system of algebraic equations","volume":"12","author":"Sasaki","year":"1989","journal-title":"Journal of Information Processing"},{"key":"10.1016\/S0747-7171(02)00140-2_B17","doi-asserted-by":"crossref","unstructured":"Traverso, C., 1988. Gr\u00f6bner Trace Algorithms, Proceedings ISSAC \u201888, Lecture Notes in Computer Science, vol. 358, pp. 125\u2013138","DOI":"10.1007\/3-540-51084-2_12"},{"key":"10.1016\/S0747-7171(02)00140-2_B18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1006\/jsco.1996.0056","article-title":"Hilbert functions and the Buchberger\u2019s algorithm","volume":"22","author":"Traverso","year":"1997","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(02)00140-2_B19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0747-7171(88)80049-X","article-title":"A p-adic approach to the computation of Gr\u00f6bner bases","volume":"6","author":"Winkler","year":"1987","journal-title":"Journal of Symbolic Computation"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001402?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001402?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T10:16:09Z","timestamp":1584526569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717102001402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0747717102001402"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(02)00140-2","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}