Computing algebraic relations in multivariate settings

The aim of this project is to design fast computing a fundamental mathematical object called algebraic relations, particularly on Pade approximants and multivariate interpolants. This is motivated by numerous important applications, within computer algebra itself and in related fields such as cryptology, coding theory, and polynomial optimization. The goal is twofold: first, to design algorithms whose complexity bounds improve over the state of the art; second, to write efficient implementations of these algorithms.

Faculty Supervisor:

Eric Schost

Student:

Partner:

Université de Limoges

Discipline:

Computer science

Sector:

Education

University:

University of Waterloo

Program:

Globalink Research Award

Current openings

Find the perfect opportunity to put your academic skills and knowledge into practice!

Find Projects