{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:08:40Z","timestamp":1725905320606},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319633114"},{"type":"electronic","value":"9783319633121"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63312-1_17","type":"book-chapter","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T11:43:13Z","timestamp":1500464593000},"page":"188-196","source":"Crossref","is-referenced-by-count":1,"title":["On Checking Linear Dependence of Parametric Vectors"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushan","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00672-6","volume-title":"Linear Algebra","author":"WH Greub","year":"1967","unstructured":"Greub, W.H.: Linear Algebra, 3rd edn. Springer, New York (1967)","edition":"3"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner-bases: an algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory - Progress, Directions and Open Problems in Multidimensional Systems, pp. 184\u2013232. Reidel Publishing Company, Dodrecht-Boston-Lancaster 1985","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"17_CR3","volume-title":"Using Algebraic Geometry","author":"D Cox","year":"2005","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Using Algebraic Geometry, 2nd edn. Springer, New York (2005)","edition":"2"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0747-7171(92)90023-W","volume":"14","author":"V Weispfenning","year":"1992","unstructured":"Weispfenning, V.: Comprehensive Groebner bases. J. Symb. Comp. 14, 1\u201329 (1992)","journal-title":"J. Symb. Comp."},{"key":"17_CR5","volume-title":"Principles and Practice of Constraint Programming","author":"D Kapur","year":"1995","unstructured":"Kapur, D.: An approach for solving systems of parametric polynomial equations. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming. MIT Press, Cambridge (1995)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Kapur, D., Sun, Y., Wang, D.K.: A new algorithm for computing comprehensive Groebner systems. In: Proceedings of ISSAC 2010. ACM Press, New York (2010)","DOI":"10.1145\/1837934.1837946"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kapur, D., Sun, Y., Wang, D.K.: Computing comprehensive Groebner systems and comprehensive Groebner bases simultaneously. In: Proceedings of ISSAC 2011. ACM Press, New York (2011)","DOI":"10.1145\/1993886.1993918"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.jsc.2007.07.022","volume":"44","author":"M Manubens","year":"2009","unstructured":"Manubens, M., Montes, A.: Minimal canonical comprehensive Groebner system. J. Symb. Comp. 44, 463\u2013478 (2009)","journal-title":"J. Symb. Comp."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Nabeshima, K.: A speed-up of the algorithm for computing comprehensive Groebner systems. In: Proceedings of ISSAC 2007. ACM Press, New York (2007)","DOI":"10.1145\/1277548.1277589"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/S0747-7171(03)00098-1","volume":"36","author":"A Suzuki","year":"2003","unstructured":"Suzuki, A., Sato, Y.: An alternative approach to comprehensive Groebner bases. J. Symb. Comp. 36, 649\u2013667 (2003)","journal-title":"J. Symb. Comp."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Suzuki, A., Sato, Y.: A simple algorithm to compute comprehensive Groebner bases using Groebner bases. In: Proceedings of ISSAC 2006. ACM Press, New York (2006)","DOI":"10.1145\/1145768.1145821"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11615798_3","volume-title":"Automated Deduction in Geometry","author":"X Chen","year":"2006","unstructured":"Chen, X., Li, P., Lin, L., Wang, D.: Proving geometric theorems by partitioned-parametric Gr\u00f6bner bases. In: Hong, H., Wang, D. (eds.) ADG 2004. LNCS, vol. 3763, pp. 34\u201343. Springer, Heidelberg (2006). doi: 10.1007\/11615798_3"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jsco.2001.0504","volume":"33","author":"A Montes","year":"2002","unstructured":"Montes, A.: A new algorithm for discussing Groebner basis with parameters. J. Symb. Comp. 33, 183\u2013208 (2002)","journal-title":"J. Symb. Comp."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-77356-6_8","volume-title":"Automated Deduction in Geometry","author":"A Montes","year":"2007","unstructured":"Montes, A., Recio, T.: Automatic discovery of geometry theorems using minimal canonical comprehensive Gr\u00f6bner systems. In: Botana, F., Recio, T. (eds.) ADG 2006. LNCS, vol. 4869, pp. 113\u2013138. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-77356-6_8"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0747-7171(08)80104-6","volume":"13","author":"WY Sit","year":"1992","unstructured":"Sit, W.Y.: An algorithm for solving parametric linear systems. J. Symb. Comp. 13, 353\u2013394 (1992)","journal-title":"J. Symb. Comp."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63312-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T19:57:54Z","timestamp":1569873474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63312-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633114","9783319633121"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63312-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}