{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:47:20Z","timestamp":1778496440395,"version":"3.51.4"},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"value":"354013350X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032840","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:41:26Z","timestamp":1133430086000},"page":"172-183","source":"Crossref","is-referenced-by-count":45,"title":["Upper and lower bounds for the degree of Groebner bases"],"prefix":"10.1007","author":[{"given":"H. Michael","family":"M\u00f6ller","sequence":"first","affiliation":[]},{"given":"Ferdinando","family":"Mora","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"D.A.BAYER, The division algorithm and the Hilbert scheme, Ph.D.Thesss,Harvard (1982)"},{"key":"17_CR2","first-page":"3","volume":"72","author":"B. Buchberger","year":"1979","unstructured":"B. BUCHBERGER, A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner bases, Proc.EUROSAM 79, L.N.Comp.Sci. 72 (1979) 3\u201321","journal-title":"L.N.Comp.Sci."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"B.BUBHBERGER, A note on the complexity of constructing Gr\u00f6bner bases, Proc.EUROCAL 83, L.N.Comp.Sci.162 (1983)","DOI":"10.1007\/3-540-12868-9_98"},{"key":"17_CR4","unstructured":"B.BUCHBERGER,F.WINKLER, Miscellaneous results on the construction of Gr\u00f6bner bases for polynomial ideals,Bericht 137;Inst.Math.Univ.Linz (1979)"},{"key":"17_CR5","first-page":"5","volume":"29","author":"R. Hartshorne","year":"1966","unstructured":"R. HARTSHORNE, Connectedness of the Hilbert scheme,Publ.Math.I.H.E.S. 29 (1966),5\u201348","journal-title":"Publ.Math.I.H.E.S."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G. Hermann","year":"1926","unstructured":"G. HERMANN, Die Frage der endlichen viele Schritten in der Theorie der Polynomideale,Math.Ann. 95 (1926), 736\u2013788","journal-title":"Math.Ann."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"D.LAZARD, Gr\u00f6bner bases,Gaussian elimination and resolution of systems of algebraic equations, Proc.EUROCAL 83, L.N.Comp.Sci. 162 (1983)","DOI":"10.1007\/3-540-12868-9_99"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"E.W. MAYR,A.R. MEYER, The complexity of the word problems for commutative semigroups and polynomial ideals, Adv.Math.46 (1982),305\u2013329","journal-title":"Adv.Math."},{"key":"17_CR9","volume-title":"Combinatorial identities","author":"J. Riordan","year":"1968","unstructured":"J. RIORDAN, Combinatorial identities,Wiley, New York,(1968)"},{"key":"17_CR10","unstructured":"B.RENSCHUCH,Elementare und praktische Idealtheorie,DWV Berlin (1976)"},{"key":"17_CR11","unstructured":"M.GIUSTI, Some effectivity problems in polynomial ideal theory, these Proceedings"}],"container-title":["Lecture Notes in Computer Science","EUROSAM 84"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:34:30Z","timestamp":1586594070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354013350X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0032840","relation":{},"subject":[]}}