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...
We have reprogrammed the genomes of living cells to construct massively parallel biological computers capable of processing two-dimensional images at a theoretical resolution of g...
In many applications noisy signals are measured. These signals has to be filtered and, sometimes, their derivative have to be computed. In this paper a method for filtering the si...
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...