Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
Abstract. In this paper we introduce the concept of an interactive mathematical document. We give a formal description of such a document, which enables us to introduce the notion ...
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...