{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:43:20Z","timestamp":1762782200031,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Japan Society for the Promotion of Science KAKENHI","award":["15K05008."],"award-info":[{"award-number":["15K05008."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3208976.3209014","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"31-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals"],"prefix":"10.1145","author":[{"given":"Toru","family":"Aoyama","sequence":"first","affiliation":[{"name":"Kobe University & Rikkyo University, Kobe & Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Noro","sequence":"additional","affiliation":[{"name":"Rikkyo University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087644"},{"key":"e_1_3_2_1_2_1","unstructured":"T. Aoyama. 2017. A Singular package of modular algorithms for Laplagne's algorithm. http:\/\/www.math.kobe-u.ac.jp\/HOME\/taoyama\/singular\/modLap.lib  T. Aoyama. 2017. A Singular package of modular algorithms for Laplagne's algorithm. http:\/\/www.math.kobe-u.ac.jp\/HOME\/taoyama\/singular\/modLap.lib"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00140-2"},{"volume-title":"Introduction to commutative algebra","author":"Atiyah M.F.","key":"e_1_3_2_1_4_1","unstructured":"M.F. Atiyah and I.G. MacDonald . 1969. Introduction to commutative algebra . Westview Press . M.F. Atiyah and I.G. MacDonald. 1969. Introduction to commutative algebra. Westview Press."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"W. Decker G-M. Greuel and G. Pfister. 1999. Primary decomposition: Algorithms and comparisons. Algorithmic algebra and number theory (1999) 187--220.  W. Decker G-M. Greuel and G. Pfister. 1999. Primary decomposition: Algorithms and comparisons. Algorithmic algebra and number theory (1999) 187--220.","DOI":"10.1007\/978-3-642-59932-3_10"},{"key":"e_1_3_2_1_6_1","unstructured":"W. Decker G-M. Greuel G. Pfister and H. Sch\u00f6nemann. 2016. Singular 4--1-0 -- A computer algebra system for polynomial computations. http:\/\/www.singular.uni-kl.de  W. Decker G-M. Greuel G. Pfister and H. Sch\u00f6nemann. 2016. Singular 4--1-0 -- A computer algebra system for polynomial computations. http:\/\/www.singular.uni-kl.de"},{"key":"e_1_3_2_1_7_1","unstructured":"J. V. Z. Gathen and J. Gerhard. 2003. Modern Computer Algebra. Cambridge University Press New York.   J. V. Z. Gathen and J. Gerhard. 2003. Modern Computer Algebra. Cambridge University Press New York."},{"key":"e_1_3_2_1_8_1","unstructured":"G-M. Greuel and G. Pfister. 2008. A Singular introduction to commutative algebra. Springer-Verlag Berlin Heidelberg.   G-M. Greuel and G. Pfister. 2008. A Singular introduction to commutative algebra. Springer-Verlag Berlin Heidelberg."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.01.003"},{"key":"e_1_3_2_1_10_1","volume-title":"Kobe university","author":"Kadota M.","year":"2009","unstructured":"M. Kadota . 2009. Decomposition algorithms for polynomial ideals by modular computation (in Japanese). Master's thesis , Kobe university ( 2009 ). M. Kadota. 2009. Decomposition algorithms for polynomial ideals by modular computation (in Japanese). Master's thesis, Kobe university (2009)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145802"},{"key":"e_1_3_2_1_12_1","volume-title":"Computation of the minimal associated primes. Challenges in Symbolic Computation Software 06271","author":"Laplagne S.","year":"2006","unstructured":"S. Laplagne . 2006. Computation of the minimal associated primes. Challenges in Symbolic Computation Software 06271 ( 2006 ). S. Laplagne. 2006. Computation of the minimal associated primes. Challenges in Symbolic Computation Software 06271 (2006)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M. Noro and K. Yokoyama. 2017 online. Usage of Modular Techniques for Efficient Computation of Ideal Operations. Mathematics in Computer Science (2017 online).  M. Noro and K. Yokoyama. 2017 online. Usage of Modular Techniques for Efficient Computation of Ideal Operations. Mathematics in Computer Science (2017 online).","DOI":"10.1007\/s11786-017-0325-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90018-Y"},{"volume-title":"Effective Polynomial Computation","author":"Zippel R.","key":"e_1_3_2_1_15_1","unstructured":"R. Zippel . 1993. Effective Polynomial Computation . Springer US. R. Zippel. 1993. Effective Polynomial Computation. Springer US."}],"event":{"name":"ISSAC '18: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"New York NY USA","acronym":"ISSAC '18"},"container-title":["Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3209014","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208976.3209014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:49Z","timestamp":1750208929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3209014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":15,"alternative-id":["10.1145\/3208976.3209014","10.1145\/3208976"],"URL":"https:\/\/doi.org\/10.1145\/3208976.3209014","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}