The course will be an introduction to selected topics in computer algebra. We will discuss the computational/computer related side of the algebra of finite fields and of polynomial rings. We will start by discussing representation of the elements in a finite field as univariate polynomials, and related algorithmics. In particular we will treat the Euclidean Algorithm, computation of inverse elements, gcd's, computation of products (Karatsuba's multiplication method, Fast Fourier Transform). For multivariate polynomials, we will discuss Groebner bases techniques.
Für weitere Informationen konktaktieren Sie bitte: