{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T02:16:18Z","timestamp":1766196978711},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0304-3975(97)00064-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:38:06Z","timestamp":1027604286000},"page":"179-202","source":"Crossref","is-referenced-by-count":13,"title":["On the walk"],"prefix":"10.1016","volume":"187","author":[{"given":"Beatrice","family":"Amrhein","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Gloor","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"K\u00fcchlin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00064-9_BIB1","series-title":"ISSAC'96","first-page":"95","article-title":"A case study of multi-threaded Gr\u00f6bner basis completion","author":"Amrhein","year":"1996"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB2","series-title":"5th Rhine Workshop on Computer Algebra","first-page":"8.1","article-title":"How fast does the Walk run?","author":"Amrhein","year":"1996"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB3","series-title":"DISCO'96","first-page":"150","article-title":"Walking faster","volume":"vol. 1128","author":"Amrhein","year":"1996"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB4","article-title":"On-line software documentation","author":"Buchberger","year":"1993","journal-title":"SACLIB User's Guide"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB5","article-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","author":"Buchberger","year":"1965"},{"issue":"3","key":"10.1016\/S0304-3975(97)00064-9_BIB6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BF01844169","article-title":"Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems","volume":"4","author":"Buchberger","year":"1970","journal-title":"Aequationes Math."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB7","series-title":"EUROSAM'79","first-page":"3","article-title":"A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner-Bases","volume":"vol. 72","author":"Buchberger","year":"1979"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB8","series-title":"Recent Trends in Multidimensional Systems Theory","article-title":"Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1985"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB9","doi-asserted-by":"crossref","DOI":"10.1006\/jsco.1996.0145","article-title":"Converting bases with the Gr\u00f6bner Walk","author":"Collart","year":"1997","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB10","series-title":"The ideal structure of Gr\u00f6bner base computations","author":"Collart","year":"1994"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB11","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","article-title":"Ideals, Varieties, and Algorithms","author":"Cox","year":"1992"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jsco.1993.1051","article-title":"Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering","volume":"16","author":"Faug\u00e8re","year":"1993","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB13","article-title":"R\u00e9solution des syst\u00e8mes d'\u00e9quations alg\u00e9briques","author":"Faug\u00e8re","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(97)00064-9_BIB14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1006\/jsco.1996.0056","article-title":"Hilbert functions and the Buchberger algorithm","volume":"22","author":"Traverse","year":"1996","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB15","series-title":"Geometric and Solid Modeling: An Introduction","author":"Hoffmann","year":"1989"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB16","series-title":"AAECC-8","first-page":"249","article-title":"Implicitization of rational curves and surfaces","volume":"vol. 508","author":"Kalkbrener","year":"1990"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB17","series-title":"IMACS'95","article-title":"Implicitization by Gr\u00f6bner basis conversion","author":"Kalkbrener","year":"1995"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB18","article-title":"Netzgenerierung impliziter und parametrischer Kurven und Fl\u00e4chen in einem objektorientierten System","author":"Klein","year":"1995"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB19","series-title":"Computer Algebra in Science and Engineering","first-page":"24","article-title":"PARSAC-2: Parallel computer algebra on the desk-top","author":"K\u00fcchlin","year":"1995"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB20","series-title":"ISSAC'94","first-page":"191","article-title":"Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion","author":"Licciardi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0747-7171(88)80042-7","article-title":"The Gr\u00f6bner Fan of an ideal","volume":"6","author":"Mora","year":"1988","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB22","unstructured":"PoSSo, Polynomial systems library, ftp: posso.dm.unipi.it."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB23","series-title":"The Magma Gr\u00f6bner Walk","author":"Steel","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(97)00064-9_BIB24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/24554.24557","article-title":"Admissible orders and linear forms","volume":"21","author":"Weispfenning","year":"1987","journal-title":"ACM Sigsam Bull."},{"key":"10.1016\/S0304-3975(97)00064-9_BIB25","article-title":"GR\u00d6BNER: A Library for computing Gr\u00f6bner Bases based on SACLIB","author":"Windsteiger","year":"1993","journal-title":"Manual for Version 2.0"},{"key":"10.1016\/S0304-3975(97)00064-9_BIB26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1086809.1086811","article-title":"On algorithms for solving systems of polynomial equations","volume":"27","author":"Yun","year":"1973","journal-title":"ACM Sigsam Bull."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:59Z","timestamp":1556522759000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0304397597000649"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00064-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}