research
∙
07/09/2022
Bit complexity for computing one point in each connected component of a smooth real algebraic set
We analyze the bit complexity of an algorithm for the computation of at ...
share
research
∙
05/05/2020
Subquadratic-Time Algorithms for Normal Bases
For any finite Galois field extension 𝖪/𝖥, with Galois group G = Gal(𝖪/𝖥...
research
∙
02/01/2020
Efficient q-Integer Linear Decomposition of Multivariate Polynomials
We present two new algorithms for the computation of the q-integer linea...
research
∙
11/30/2019
Counting invariant subspaces and decompositions of additive polynomials
The functional (de)composition of polynomials is a topic in pure and com...
research
∙
09/15/2019
Efficient Rational Creative Telescoping
We present a new algorithm to compute minimal telescopers for rational f...
research
∙
03/08/2019
Quadratic Probabilistic Algorithms for Normal Bases
It is well known that for any finite Galois extension field K/F, with Ga...
research
∙
12/11/2018
Computing Nearby Non-trivial Smith Forms
We consider the problem of computing the nearest matrix polynomial with ...
research
∙
12/11/2017
Computing Lower Rank Approximations of Matrix Polynomials
Given an input matrix polynomial whose coefficients are floating point n...
research
∙
01/08/2017