Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On the complexity of computing integral bases of function fields

Abstract : Let $\mathcal{C}$ be a plane curve given by an equation $f(x, y) = 0$ with $f ∈ K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new complexity bounds for three known algorithms dealing with this problem. For each algorithm, we study its subroutines and, when it is possible, we modify or replace them so as to take advantage of faster primitives. Then, we combine complexity results to derive an overall complexity estimate for each algorithm. In particular, we modify an algorithm due to Böhm et al. and achieve a quasi-optimal runtime.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Simon Abelard <>
Submitted on : Friday, May 8, 2020 - 1:42:52 PM
Last modification on : Saturday, November 28, 2020 - 3:29:26 AM


Files produced by the author(s)


  • HAL Id : hal-02568086, version 1


Simon Abelard. On the complexity of computing integral bases of function fields. 2020. ⟨hal-02568086v1⟩



Record views


Files downloads