This thesis studies algorithms for computing Gröbner bases of ideals in multivariate polynomial rings and explores their practical applications. A Gröbner basis provides a structured way to represent polynomial ideals.
