3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.AC2018★ 3 cited
A New Bound on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
Mengxiao Sun
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…
math.AG2016
Complexity of Triangular Representations of Algebraic Sets
Eli Amzallag, Gleb Pogudin, Mengxiao Sun +1
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szant…