Barvinok's algorithm
- Suitable for
- Undergraduate thesis
- Prerequisites
- Mathematical maturity, abstract algebra, geometry
Study Barvinok’s algorithm for short rational function decomposition. This project is about the study of the proof of Barvinok’s algorithm to explain both how it works and why it is polynomial in complexity (if the dimension is fixed)