Computer Algebra

Course: AMT 353 2.0 Computer Algebra (Compulsory)

 Course content: Analysis of Algorithms: Running time, Algorithm Design, Algorithm Validation, Algorithm Analysis, Coding, Testing; List Processing: Representation, Manipulations, Elementary Functions; Integers: β Integers, Arithmetic Operations; Modular Integers and Chinese Remainder Algorithm: Modular Arithmetic Algorithms, Chinese Remainder Theorem; Polynomials: Representations, Polynomial Semi-norms, Polynomial Operations; Grobner Basis: Buchberger Algorithm, Applications of Gr¨obner Basis, Real Zero Isolation of a Uni-variate Polynomial: Sturms Method, Coefficient Sign Variation Method, Differentiation Method; Complex Zero Isolation of a Uni-variate Polynomial

 Recommended Readings: