Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
M.F. Atiyah, I.G. MacDonald, Introduction to Commutative Algebra, Addison-Wesley, Reading, Mass. (1969), IX+128 pp.
B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Ideal, Ph.D. Thesis, Innsbruck, (1965).
B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, Recent trends in multidimensional systems theory Bose N.K. Reidel (1985).
P. Gianni, T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases. Communication at A.A.E.C.C. 5, Menorca 1987.
P. Gianni, B. Trager, G. Zacharias, Gröbner bases and primary decomposition of polynomial ideals. Preprint (1986).
H. Kredel, V. Weispfenning, Computing dimension and independent sets for polynomial ideals. Preprint (1986).
J. Nagata, Field theory, Marcel Dekker, INC, New York and Basel (1977).
A. Seidenberg, Construction of the integral closure of a finite integral domain, Rend. Sem. Mat. Fis. Milano 40, 101–120, (1970).
A. Seidenberg, Constructions in algebra, Trans. A.M.S.197, 273–313 (1974).
C. Traverso, A study of algebraic algorithms: the normalization, Report Pisa, (1986)
V. Vasconcelos, What is a prime ideal? Preprint.
O. Zariski, P. Samuel, Commutative algebra, I, II, Springer-Verlag (1975).
References
D. Brownawell, Bouds for the degree in the Nullstellensatz, Annals of Math. 2nd ser. 126, n.3,1987, p. 577–591.
L. Caniglia, A. Galligo, J. Heintz, Borne simple exponentielle pour les degrés dans le théorème des zéros sur un corps de caractéristique quelconque. C.R.Acad.Sci. Paris, t.307 Ser.I (1988) 255–258.
L. Caniglia, A. Galligo, J. Heintz, Some new effectivity bounds in computationa geometry. These Proceedings.
N. Fitchas, M. Giusti, The membership problem in the unmixed case is in NC. Manuscript (1988).
A. Galligo, C. Traverso, Practical determination of the dimendion of an algebraic variety. Preprint (1988).
J. Heintz, Definability and fast quantifier elimination in algebraically closed fields. Theoret.Comput.Sci. 24 (1983) 239–277.
J. Kollar, Sharp effective Nullstellensatz. Manuscript (1988).
D. Lazard, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Proc. EUROCAL 1983, Springer L.N.Comp.Sci. 162 (1983).
M. Möller, F. Mora, Upper and lower bounds for the degree of Gröbner bases, Proc. EUROSAM 84 Springer L.N.Comp.Sci. 174 (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Logar, A. (1989). A computational proof of the Noether normalization lemma. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_65
Download citation
DOI: https://doi.org/10.1007/3-540-51083-4_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51083-3
Online ISBN: 978-3-540-46152-4
eBook Packages: Springer Book Archive