A new bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation
A new bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation
The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski's algorithm for computing the Galois group of a linear differential equation. This bound is the degree bound of the polynomials used in …