We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
We compute all nonic extensions of Q3 and find that there are 795 of them up to isomorphism. We describe how to compute the associated Galois group of such a field, and also the ...
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...