{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:41:34Z","timestamp":1782837694664,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["109712171077120660821002\/F02"],"award-info":[{"award-number":["109712171077120660821002\/F02"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0729097"],"award-info":[{"award-number":["CCF-0729097"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1837934.1837946","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"29-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["A new algorithm for computing comprehensive Gr\u00f6bner systems"],"prefix":"10.1145","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[{"name":"University of New Mexico, Albuquerque, NM"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[{"name":"Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/151108"},{"key":"e_1_3_2_1_2_1","volume-title":"Proving geometric theorems by partitioned-parametric Gr\u00f6bner bases","author":"Chen X. F.","year":"2005","unstructured":"Chen , X. F. , Li , P. , Lin , L. , Wang , D. K. ( 2005 ) Proving geometric theorems by partitioned-parametric Gr\u00f6bner bases . In: Hong, H., Wang, D. (eds.) ADG 2004. LNAI, vol. 3763 , 34--44. Springer . Chen, X. F., Li, P., Lin, L., Wang, D. K. (2005) Proving geometric theorems by partitioned-parametric Gr\u00f6bner bases. In: Hong, H., Wang, D. (eds.) ADG 2004. LNAI, vol. 3763, 34--44. Springer."},{"key":"e_1_3_2_1_3_1","volume-title":"Using Algebraic Geometry","author":"Cox D.","year":"2004","unstructured":"Cox , D. , Little , J. , O'Shea , D. ( 2004 ). Using Algebraic Geometry . New York , Springer . 2 nd edition. ISBN 0-387-20706-6. Cox, D., Little, J., O'Shea, D. (2004). Using Algebraic Geometry. New York, Springer. 2nd edition. ISBN 0-387-20706-6.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/550525"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1217599"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0113"},{"key":"e_1_3_2_1_7_1","volume-title":"Principles and Practice of Constraint Programming","author":"Kapur D.","year":"1995","unstructured":"Kapur , D. ( 1995 ). An approach to solving systems of parametric polynomial equations . In: Saraswat, Van Hentenryck (eds.) Principles and Practice of Constraint Programming , MIT Press , Cambridge . Kapur, D. (1995). An approach to solving systems of parametric polynomial equations. In: Saraswat, Van Hentenryck (eds.) Principles and Practice of Constraint Programming, MIT Press, Cambridge."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-006-0307-x"},{"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.1006\/jsco.2001.0504"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784950.1784958"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277589"},{"key":"e_1_3_2_1_13_1","volume-title":"K. (2007)","author":"Nabeshima","year":"2007","unstructured":"Nabeshima , K. (2007) PGB: A Package for Computing Parametric Gr\u00f6bner Bases and Related Objects. Conference posters of ISSAC 2007 , 104--105. Nabeshima, K. (2007) PGB: A Package for Computing Parametric Gr\u00f6bner Bases and Related Objects. Conference posters of ISSAC 2007, 104--105."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780539"},{"key":"e_1_3_2_1_15_1","volume-title":"ACA2004","author":"Suzuki A.","year":"2004","unstructured":"Suzuki , A. and Sato , Y . ( 2004 ) Comprehensive Gr\u00f6bner Bases via ACGB. In Tran, Q-N., editor , ACA2004 , 65--73. Suzuki, A. and Sato, Y. (2004) Comprehensive Gr\u00f6bner Bases via ACGB. In Tran, Q-N., editor, ACA2004, 65--73."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145821"},{"key":"e_1_3_2_1_17_1","volume-title":"An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field. arXiv:0907.2300v1","author":"Wang D. K.","year":"2009","unstructured":"Wang , D. K. and Sun , Y . ( 2009 ) An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field. arXiv:0907.2300v1 . Wang, D. K. and Sun, Y. (2009) An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field. arXiv:0907.2300v1."},{"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"}],"event":{"name":"ISSAC '10: International Symposium on Symbolic and Algebraic Computation","location":"Munich Germany","acronym":"ISSAC '10","sponsor":["Gesellschaft fur Informtatik","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837934.1837946","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837934.1837946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:43Z","timestamp":1750249423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837934.1837946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":19,"alternative-id":["10.1145\/1837934.1837946","10.1145\/1837934"],"URL":"https:\/\/doi.org\/10.1145\/1837934.1837946","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}