{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:42Z","timestamp":1750306662789,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1217054"],"award-info":[{"award-number":["DMS-1217054"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,24]]},"DOI":"10.1145\/2755996.2756676","type":"proceedings-article","created":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T14:43:22Z","timestamp":1435243402000},"page":"243-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gr\u00f6bner Basis and the Associated Completion Algorithm"],"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":"Yiming","family":"Yang","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.699008"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1951670"},{"key":"e_1_3_2_1_3_1","unstructured":"W. Decker G.-M. Greuel G. Pfister H. Sch\u00f6nemann Singular 3-1-6 -- A computer algebra system for polynomial computations. http:\/\/www.singular.uni-kl.de (2012)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0113"},{"key":"e_1_3_2_1_5_1","first-page":"217","volume-title":"An approach for solving systems of parametric polynomial equations","author":"Kapur D.","year":"1995","unstructured":"D. Kapur, An approach for solving systems of parametric polynomial equations, In: Saraswat, Vijay, Van Hentenryck, Pascal (Eds.), Principles and Practices of Constraints Programming, MIT Press, pp. 217--224, 1995"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.015"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2012.05.015"},{"key":"e_1_3_2_1_8_1","volume-title":"EACA 2014: 21","author":"Kapur D.","year":"2014","unstructured":"D. Kapur, Y. Yang, An algorithm for computing a minimal comprehensive Gr\u00f6bner basis of a parametric polynomial system, EACA 2014: 21, 2014"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.09.013"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.07.022"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0504"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.06.017"},{"key":"e_1_3_2_1_13_1","first-page":"135","volume-title":"Proceedings of EACA 2012","author":"Montes A.","year":"2012","unstructured":"A. Montes, Using Kapur-Sun-Wang algorithm for the Gr\u00f6bner cover, In Proceedings of EACA 2012. Ed.: J.R. Sendra, C. Villarino. Universidad de Alcal\u00e1 de Henares., pp. 135--138, 2012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277589"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00098-1"},{"key":"e_1_3_2_1_16_1","volume-title":"ACA2004:  65--73","author":"Suzuki A.","year":"2004","unstructured":"A. Suzuki, and Y. Sato, Comprehensive Gr\u00f6bner bases via ACGB, ACA2004: 65--73, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145821"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90023-W"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00099-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.05.001"}],"event":{"name":"ISSAC'15: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Bath United Kingdom","acronym":"ISSAC'15"},"container-title":["Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755996.2756676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755996.2756676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:31Z","timestamp":1750230031000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755996.2756676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":20,"alternative-id":["10.1145\/2755996.2756676","10.1145\/2755996"],"URL":"https:\/\/doi.org\/10.1145\/2755996.2756676","relation":{},"subject":[],"published":{"date-parts":[[2015,6,24]]},"assertion":[{"value":"2015-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}