This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D.A.Bayer, The division algorithm and the Hilbert scheme, Ph.D.Thesis, Havard (1982).
B.Buchberger, A critical-pair/completion algorithm for finitely generated ideals in rings, Springer L.N. in Comp. Sci. 171 (1983).
B.Buchberger, Gröbner bases: An algorithmic method in polynomial ideal theory, in: Recent Trends in Multidimensional Systems Theory (ed.: N.K.Bose), D. Reidel Publ. Comp. 1984.
B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gröbner bases, Proc. EUROSAM 79, Springer L.N. in Comp.Sci. 72 (1979) 3–21.
M. Giusti, Some effectivity problems in polynomial ideal theory, Springer L.N. in Comp. Sci. 174 (1984), 159–171.
H.M.Möller and F.Mora, New constructive methods in classical ideal theory, to appear in J. of Algebra.
H.M. Möller and F. Mora, The computation of the Hilbert function, Proc. EUROCAL 83, Springer L.N. in Comp.Sci. 162 (1983), 157–167.
H.M.Möller and F.Mora, Computational aspects of reduction strategies to construct resolutions of monomial ideals, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möller, H.M. (1985). A reduction strategy for the taylor resolution. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_323
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_323
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive