Faculty of Mathematics and Computer Science

Computational algebra |

Code |
Semes-ter |
Hours: C+S+L |
Credits |
Type |
Section |

Teaching Staff in Charge |

Prof. MARCUS Andrei, Ph.D., marcus@math.ubbcluj.ro |

Aims |

We present some of the most important algorithms with applications to problems in abstract algebra but not only. We also discuss the complexity of these algorithms. |

Content |

Finite fields. Discrete logarithm. Factorization of polynomials over finite fields. Berlakamp's algorithm. Fast adding. Fast Fourier transform. Groebner basis. Buchberger's algorithm. Generators and relations in groups. The Todd-Coxeter algorithm. Lattice reduction and the LLL-algorithm. Factorization of polynomials over the rationals. |

References |

Assessment |