GSoC/GCI Archive
Google Summer of Code 2013 SymPy

Faster Algorithms for Polynomials over Algebraic Number Fields

by Katja Sophie Hotz for SymPy

The goal of this project is the implementation of faster greatest common divisor and factorization algorithms for univariate and multivariate polynomials over algebraic number fields. This is important for symbolic integration of rational functions and simplification of expressions among other things.