Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
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...
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...