On the complexity of the D5 principle Xavier Dahan Marc Moreno Maza ´

First Page		Document Content
Date: 2006-02-10 10:46:26 Computer algebra Polynomials Algebraic geometry Euclid Extended Euclidean algorithm Commutative algebra Euclidean algorithm Matrix Polynomial greatest common divisor Factorization of polynomials over finite fields		On the complexity of the D5 principle Xavier Dahan Marc Moreno Maza ´ Add to Reading List Source URL: www.csd.uwo.ca Download Document from Source Website File Size: 202,17 KB Share Document on Facebook

	A few facts on integrality BRIEF VERSION Darij Grinberg VersionNovemberThe purpose of this note is to collect some theorems and proofs related to integrality in commutative algebra. The note is subdivided DocID: 1uZLU - View Document
	A few facts on integrality DETAILED VERSION Darij Grinberg VersionNovemberThe purpose of this note is to collect some theorems and proofs related to integrality in commutative algebra. The note is subdivi DocID: 1uxaH - View Document
	The Concise Handbook of Algebra, Kluwer Publ), H.6 Homological Characterization of Rings: The Commutative Case Sarah Glaz DocID: 1us8p - View Document
	A Primer of Commutative Algebra James S. Milne March 18, 2017, v4.02 Abstract These notes collect the basic results in commutative algebra used in the rest of my notes and books. Although most of the material is standard DocID: 1ue7G - View Document
	SEMINAR ÜBER KOMMUTATIVE ALGEBRA: GRÖBNERBASEN UND REGULARITÄT PROF. DR. MORITZ KERZ, DR. FLORIAN STRUNK WEDNESDAY 10–12, M 101 In the first part of the seminar we discuss constructive methods in Commutative Algebr DocID: 1u2Zs - View Document