{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:32:04Z","timestamp":1743046324575,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041020"},{"type":"electronic","value":"9783642041037"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04103-7_27","type":"book-chapter","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T01:41:17Z","timestamp":1254274877000},"page":"310-321","source":"Crossref","is-referenced-by-count":4,"title":["Computing Gr\u00f6bner Bases within Linear Algebra"],"prefix":"10.1007","author":[{"given":"Akira","family":"Suzuki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput.\u00a024(3-4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"27_CR2","unstructured":"Brickenstein, M.: Slimgb: Gr\u00f6bner bases with slim polynomials. Reports on Computer Algebra 35, ZCA, University of Kaiserslautern (2005)"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B. Buchberger","year":"1970","unstructured":"Buchberger, B.: Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Geichungssystems. Aequ. Math.\u00a04(3), 374\u2013383 (1970)","journal-title":"Aequ. Math."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Caboara, M.: A dynamic algorithm for Gr\u00f6bner basis computation. In: Proc. ISSAC 1993, pp. 275\u2013283 (1993)","DOI":"10.1145\/164081.164141"},{"issue":"3\u20134","key":"27_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1006\/jsco.1996.0145","volume":"24","author":"S. Collart","year":"1997","unstructured":"Collart, S., Kalkbrenner, M., Mall, D.: Converting Bases with the Gr\u00f6bner Walk. J. Symb. Comput.\u00a024(3\u20134), 465\u2013469 (1997)","journal-title":"J. Symb. Comput."},{"issue":"1\u20133","key":"27_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F 4). J. Pure and Applied Algebra\u00a0139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure and Applied Algebra"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F 5). In: Proc. ISSAC 2002, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.C. Faug\u00e9re","year":"1993","unstructured":"Faug\u00e9re, J.C., Gianni, P.M., Lazard, D., Mora, T.: Efficient Computation of Zero Dimensional Gr\u00f6bner Bases by Change of Ordering. J. Symb. Comput.\u00a016(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"issue":"2-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","volume":"6","author":"R. Gebauer","year":"1988","unstructured":"Gebauer, R., M\u00f6ller, H.M.: On an installation of Buchberger\u2019s algorithm. J. Symb. Comput.\u00a06(2-3), 275\u2013286 (1988)","journal-title":"J. Symb. Comput."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Giovini, A., Mora, T., Nielsi, G., Robbiano, L., Traverso, C.: One sugar cube, pleaseh OR Selection strategies in the Buchberger algorithm. In: Proc. ISSAC 1991, pp. 49\u201354 (1991)","DOI":"10.1145\/120694.120701"},{"key":"27_CR11","first-page":"167","volume":"108","author":"G.M. Greuel","year":"2006","unstructured":"Greuel, G.M., Pfister, G.: SINGULAR and Applications. Jahresbericht der DMV\u00a0108, 167\u2013196 (2006)","journal-title":"Jahresbericht der DMV"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume-title":"Computer Algebra","author":"D. Lazard","year":"1983","unstructured":"Lazard, D.: Gr\u00f6bner-Bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983)"},{"issue":"2-3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0747-7171(88)80042-7","volume":"6","author":"T. Mora","year":"1988","unstructured":"Mora, T., Robbiano, L.: The Gr\u00f6bner fan of an ideal. J. Symb. Comput.\u00a06(2-3), 183\u2013208 (1988)","journal-title":"J. Symb. Comput."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Noro, M., Takeshima, T.: Risa\/Asir \u2013 A Computer Algebra System. In: Proc. ISSAC 1992, pp. 387\u2013396 (1992)","DOI":"10.1145\/143242.143362"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-51084-2_12","volume-title":"Symbolic and Algebraic Computation","author":"C Traverso","year":"1989","unstructured":"Traverso, C.: Gr\u00f6bner trace algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol.\u00a0358, pp. 125\u2013138. Springer, Heidelberg (1989)"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1006\/jsco.1996.0056","volume":"22","author":"C. Traverso","year":"1996","unstructured":"Traverso, C.: Hilbert functions and the Buchbeger algorithm. J. Symb. Comput.\u00a022(4), 355\u2013376 (1996)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04103-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T18:49:42Z","timestamp":1558550982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04103-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041020","9783642041037"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04103-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}