7 citations · 19 across the 8 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2024
Fast computation of integral bases
Adrien Poteaux, Martin Weimann
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to t…
math.NT2019★ 1 cited
A quasi-linear irreducibility test in K[[x]][y]
Adrien Poteaux, Martin Weimann
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and…