Ask a Question

Prefer a chat interface with context about you and your work?

Fast computation of integral bases

Fast computation of integral bases

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 the size of the output when the residual characteristic is zero or big enough. Analogous results are obtained for …