{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:13:57Z","timestamp":1761581637052},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T00:00:00Z","timestamp":1513641600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11786-017-0325-1","type":"journal-article","created":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T07:39:44Z","timestamp":1513669184000},"page":"1-32","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Usage of Modular Techniques for Efficient Computation of Ideal Operations"],"prefix":"10.1007","volume":"12","author":[{"given":"Masayuki","family":"Noro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,19]]},"reference":[{"key":"325_CR1","volume-title":"An Introduction to Gr\u00f6bner Bases. Graduate Studies in Mathematics 3","author":"WW Adams","year":"1994","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases. Graduate Studies in Mathematics 3. American Mathematical Society, Providence (1994)"},{"key":"325_CR2","doi-asserted-by":"crossref","unstructured":"Afzal, D., Kanwal, F., Pfister, G., Steidel, S.: Solving via Modular Methods. In: Bridging Algebra, Geometry, and Topology, Springer Proceedings in Mathematics & Statistics, vol. 96, pp. 1\u20139 (2014)","DOI":"10.1007\/978-3-319-09186-0_1"},{"key":"325_CR3","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0747-7171(02)00140-2","volume":"35","author":"E Arnold","year":"2003","unstructured":"Arnold, E.: Modular algorithms for computing Gr\u00f6bner bases. J. Symb. Comput. 35, 403\u2013419 (2003)","journal-title":"J. Symb. Comput."},{"key":"325_CR4","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1090\/mcom\/2951","volume":"84","author":"J B\u00f6hm","year":"2015","unstructured":"B\u00f6hm, J., Decker, W., Fieker, C., Pfister, G.: The use of bad primes in rational reconstruction. Math. Comput. 84, 3013\u20133027 (2015)","journal-title":"Math. Comput."},{"key":"325_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-16721-3","volume-title":"Ideals, Varieties, and Algorithms, Undergraduate Text in Mathematics","author":"D Cox","year":"2015","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, Undergraduate Text in Mathematics, 4th edn. Springer, New York (2015)","edition":"4"},{"key":"325_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.jco.2011.05.001","volume":"28","author":"X Dahan","year":"2012","unstructured":"Dahan, X., Kadri, A., Schost, \u00c9.: Bit-size estimates for triangular sets in positive dimension. J. Complex. 28, 109\u2013135 (2012)","journal-title":"J. Complex."},{"key":"325_CR7","doi-asserted-by":"crossref","unstructured":"Dahan, X., Moreno Maza, M., Schost, \u00c9., Wu, W., Xie, Y.: Lifting techniques for triangular decompositions. In: Proceedings of ISSAC 2005, pp. 108\u2013115. ACM Press (2005)","DOI":"10.1145\/1073884.1073901"},{"key":"325_CR8","doi-asserted-by":"crossref","unstructured":"Dahan, X., Schost, \u00c9: Sharp estimates for triangular sets. In: Proceedings of ISSAC 2004, pp. 103\u2013110. ACM Press (2004)","DOI":"10.1145\/1005285.1005302"},{"key":"325_CR9","first-page":"187","volume-title":"Algorithmic Algebra and Number Theory","author":"W Decker","year":"1998","unstructured":"Decker, W., Greuel, G.-M., Pfister, G.: Primary decomposition: algorithms and comparisons. In: Matzat, B.H., Greuel, G.M., Hiss, G. (eds.) Algorithmic Algebra and Number Theory, pp. 187\u2013220. Springer, Berlin (1998)"},{"key":"325_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases ( $$F_4$$ F 4 ). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"325_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1006\/jsco.1993.1014","volume":"15","author":"H Gr\u00e4be","year":"1993","unstructured":"Gr\u00e4be, H.: On lucky primes. J. Symb. Comput. 15, 199\u2013209 (1993)","journal-title":"J. Symb. Comput."},{"key":"325_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04963-1","volume-title":"A Singular Introduction to Commutative Algebra","author":"G-M Greuel","year":"2002","unstructured":"Greuel, G.-M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Berlin (2002)"},{"key":"325_CR13","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.jsc.2011.01.003","volume":"46","author":"N Idrees","year":"2011","unstructured":"Idrees, N., Pfister, G., Steidel, S.: Parallelization of modular algorithms. J. Symb. Comput. 46, 672\u2013684 (2011)","journal-title":"J. Symb. Comput."},{"key":"325_CR14","volume-title":"Computational Commutative Algebra 2","author":"M Kreuzer","year":"2005","unstructured":"Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 2. Springer, Berlin (2005)"},{"key":"325_CR15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11786-012-0112-y","volume":"6","author":"S Orange","year":"2012","unstructured":"Orange, S., Renault, G., Yokoyama, K.: Efficient arithmetic in successive algebraic extension fields using symmetries. Math. Comput. Sci. 6, 217\u2013233 (2012)","journal-title":"Math. Comput. Sci."},{"key":"325_CR16","doi-asserted-by":"crossref","unstructured":"Noro, M.: Modular algorithms for computing a generating set of the syzygy module. In: Computer Algebra in Scientific Computing CASC 2009, LNCS, vol. 5743, pp. 259\u2013268. Springer (2009)","DOI":"10.1007\/978-3-642-04103-7_23"},{"key":"325_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1006\/jsco.1999.0275","volume":"28","author":"M Noro","year":"1999","unstructured":"Noro, M., Yokoyama, K.: A modular method to compute the rational univariate representation of zero-dimensional Ideals. J. Symb. Comput. 28, 243\u2013263 (1999)","journal-title":"J. Symb. Comput."},{"key":"325_CR18","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.jsc.2003.08.004","volume":"38","author":"M Noro","year":"2004","unstructured":"Noro, M., Yokoyama, K.: Implementation of prime decomposition of polynomial ideals over small finite fields. J. Symb. Comput. 38, 1227\u20131246 (2004)","journal-title":"J. Symb. Comput."},{"key":"325_CR19","doi-asserted-by":"crossref","unstructured":"Noro, M., Yokoyama, K.: Verification of Gr\u00f6bner basis candidates. In: Mathematical Software-ICMS 2014, LNCS, vol. 8592, pp. 419\u2013424. Springer (2014)","DOI":"10.1007\/978-3-662-44199-2_64"},{"key":"325_CR20","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0747-7171(92)90018-Y","volume":"14","author":"F Pauer","year":"1992","unstructured":"Pauer, F.: On lucky ideals for Gr\u00f6bner bases computations. J. Symb. Comput. 14, 471\u2013482 (1992)","journal-title":"J. Symb. Comput."},{"key":"325_CR21","first-page":"129","volume":"15","author":"G Pfister","year":"2007","unstructured":"Pfister, G.: On modular computation of standard basis. Anal. Stiint. Univ. Ovidius Constanta 15, 129\u2013138 (2007)","journal-title":"Anal. Stiint. Univ. Ovidius Constanta"},{"key":"325_CR22","doi-asserted-by":"crossref","unstructured":"Renault, G., Yokoyama, K.: Multi-modular algorithm for computing the splitting field of a polynomial. In: Proceedings of ISSAC 2008, pp. 247\u2013254. ACM Press (2008)","DOI":"10.1145\/1390768.1390803"},{"key":"325_CR23","doi-asserted-by":"crossref","first-page":"5905","DOI":"10.1088\/1751-8113\/40\/22\/010","volume":"40","author":"V Romanovski","year":"2007","unstructured":"Romanovski, V., Chen, X., Hu, Z.: Linearizability of linear systems perturbed by fifth degree homogeneous polynomials. J. Phys. A Math. Theor. 40, 5905\u20135919 (2007)","journal-title":"J. Phys. A Math. Theor."},{"key":"325_CR24","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cam.2011.06.018","volume":"236","author":"V Romanovski","year":"2011","unstructured":"Romanovski, V., Pre\u0160ern, M.: An approach to solving systems of polynomials via modular arithmetics with applications. J. Comput. Appl. Math. 236, 196\u2013208 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"325_CR25","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jsc.2013.01.005","volume":"54","author":"S Steidel","year":"2013","unstructured":"Steidel, S.: Gr\u00f6bner bases of symmetric ideals. J. Symb. Comput. 54, 72\u201386 (2013)","journal-title":"J. Symb. Comput."},{"key":"325_CR26","first-page":"371","volume":"12","author":"T Sasaki","year":"1989","unstructured":"Sasaki, T., Takeshima, T.: A modular method for Gr\u00f6bner-bases construction over $${\\mathbb{Q}}$$ Q and solving system of algebraic equations. J. Inf. Process. 12, 371\u2013379 (1989)","journal-title":"J. Inf. Process."},{"key":"325_CR27","volume-title":"Gr\u00f6bner Bases and Convex Polytopes, AMS University Lecture Series","author":"B Sturmfels","year":"1996","unstructured":"Sturmfels, B.: Gr\u00f6bner Bases and Convex Polytopes, AMS University Lecture Series, vol. 8. American Mathematical Society, Providence (1996)"},{"key":"325_CR28","doi-asserted-by":"crossref","unstructured":"Traverso, C.: Gr\u00f6bner trace algorithms. In: Proceedings of ISSAC 1988, LNCS, vol. 358, pp. 125\u2013138. Springer (1988)","DOI":"10.1007\/3-540-51084-2_12"},{"key":"325_CR29","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1006\/jsco.1996.0056","volume":"22","author":"C Traverso","year":"1997","unstructured":"Traverso, C.: Hilbert functions and the Buchberger algorithm. J. Symb. Comput. 22, 355\u2013376 (1997)","journal-title":"J. Symb. Comput."},{"key":"325_CR30","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"325_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0747-7171(88)80049-X","volume":"6","author":"F Winkler","year":"1988","unstructured":"Winkler, F.: A p-adic approach to the computation of Gr\u00f6bner bases. J. Symb. Comput. 6, 287\u2013304 (1988)","journal-title":"J. Symb. Comput."},{"key":"325_CR32","doi-asserted-by":"crossref","unstructured":"Yokoyama, K.: Usage of modular techniques for efficient computation of ideal operations\u2014(Invited Talk). In: Computer Algebra in Scientific Computing CASC 2012, LNCS, vol. 7442, pp. 361\u2013362 (2012)","DOI":"10.1007\/978-3-642-32973-9_30"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-017-0325-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0325-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-017-0325-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T06:53:32Z","timestamp":1570517612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-017-0325-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,19]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["325"],"URL":"https:\/\/doi.org\/10.1007\/s11786-017-0325-1","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,19]]}}}