{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:11:24Z","timestamp":1775095884116,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"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":[{"DOI":"10.13039\/501100005151","name":"Chinese Academy of Sciences Key Project","doi-asserted-by":"publisher","award":["QYZDJ-SSW-SYS022"],"award-info":[{"award-number":["QYZDJ-SSW-SYS022"]}],"id":[{"id":"10.13039\/501100005151","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371356"],"award-info":[{"award-number":["11371356"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3208976.3208980","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"239-246","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD"],"prefix":"10.1145","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Lu","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Monagan","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/164081.164112"},{"key":"e_1_3_2_2_2_1","first-page":"173","article-title":"Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials","volume":"4","author":"Ayad A.","year":"2010","unstructured":"A. Ayad . 2010 . Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials . International Journal of Algebra Vol. 4 , 4 (2010), 173 -- 188 . A. Ayad. 2010. Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials. International Journal of Algebra Vol. 4, 4 (2010), 173--188.","journal-title":"International Journal of Algebra"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/321662.321664"},{"key":"e_1_3_2_2_4_1","volume-title":"varieties, and algorithms","author":"Cox D.","unstructured":"D. Cox , J. Little , and D. O'shea . 1992. Ideals , varieties, and algorithms . Springer , third edition. D. Cox, J. Little, and D. O'shea. 1992. Ideals, varieties, and algorithms. Springer, third edition."},{"key":"e_1_3_2_2_5_1","volume-title":"Using algebraic geometry","author":"Cox D.","unstructured":"D. Cox , J. Little , and D. O'shea . 2005. Using algebraic geometry . Springer , New York , second edition. D. Cox, J. Little, and D. O'shea. 2005. Using algebraic geometry. Springer, New York, second edition."},{"key":"e_1_3_2_2_6_1","unstructured":"W. Decker G.-M. Greuel G. Pfister and H. Schoenemann. 2016. SINGULAR 4.0.3. a computer algebra system for polynomial computations FB Mathematik der Universitaet D-67653 Kaiserslautern. https:\/\/www.singular.uni-kl.de\/.  W. Decker G.-M. Greuel G. Pfister and H. Schoenemann. 2016. SINGULAR 4.0.3. a computer algebra system for polynomial computations FB Mathematik der Universitaet D-67653 Kaiserslautern. https:\/\/www.singular.uni-kl.de\/."},{"key":"e_1_3_2_2_7_1","volume-title":"European Conference on Computer Algebra. Lecture Notes in Computer Science, vol 204","author":"Gianni P.","unstructured":"P. Gianni and B. Trager . 1985. GCDs and factoring multivariate polynomials using Gr\u00f6bner bases Proceedings of EUROCAL '85 , European Conference on Computer Algebra. Lecture Notes in Computer Science, vol 204 . Springer, Berlin, Heidelberg. 409--410. P. Gianni and B. Trager. 1985. GCDs and factoring multivariate polynomials using Gr\u00f6bner bases Proceedings of EUROCAL '85, European Conference on Computer Algebra. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. 409--410."},{"key":"e_1_3_2_2_8_1","volume-title":"An approach for solving systems of parametric polynomial equations Principles and Practices of Constraint Programming, bibfieldeditor","author":"Kapur D.","unstructured":"D. Kapur . 1995. An approach for solving systems of parametric polynomial equations Principles and Practices of Constraint Programming, bibfieldeditor Saraswat and Van Hentenryck (Eds.). MIT Press , 217--244. D. Kapur. 1995. An approach for solving systems of parametric polynomial equations Principles and Practices of Constraint Programming, bibfieldeditorSaraswat and Van Hentenryck (Eds.). MIT Press, 217--244."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837946"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.015"},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings of Conference Encuentros de Algebra Comptacionaly Aplicaciones (EACA).","author":"Kapur D.","unstructured":"D. Kapur and Y. Yang . 2014. An algorithm for computing a minimal comprehensive Gr\u00f6bner basis of a parametric polynomial system . In Proceedings of Conference Encuentros de Algebra Comptacionaly Aplicaciones (EACA). D. Kapur and Y. Yang. 2014. An algorithm for computing a minimal comprehensive Gr\u00f6bner basis of a parametric polynomial system. In Proceedings of Conference Encuentros de Algebra Comptacionaly Aplicaciones (EACA)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0504"},{"key":"e_1_3_2_2_13_1","unstructured":"A. Montes and H. Schoenemann. 2016. grobcov.lib. http:\/\/www.singular.uni-kl.de\/Manual\/latest\/sing_900.htm.  A. Montes and H. Schoenemann. 2016. grobcov.lib. http:\/\/www.singular.uni-kl.de\/Manual\/latest\/sing_900.htm."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800192.805698"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32973-9_21"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087621"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2015.15"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80105-8"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145821"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90023-W"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.698972"}],"event":{"name":"ISSAC '18: International Symposium on Symbolic and Algebraic Computation","location":"New York NY USA","acronym":"ISSAC '18","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"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.3208980","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208976.3208980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:48Z","timestamp":1750208928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3208980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":21,"alternative-id":["10.1145\/3208976.3208980","10.1145\/3208976"],"URL":"https:\/\/doi.org\/10.1145\/3208976.3208980","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"}}]}}