Sciweavers

2087 search results - page 45 / 418
» Computation of class numbers of quadratic number fields
Sort
View
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 8 months ago
Fast separable factorization and applications
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 ...
Grégoire Lecerf
TIT
2002
82views more  TIT 2002»
13 years 8 months ago
Order estimation for a special class of hidden Markov sources and binary renewal processes
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...
Sanjeev Khudanpur, Prakash Narayan
MLQ
2002
74views more  MLQ 2002»
13 years 8 months ago
Computability on Regular Subsets of Euclidean Space
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...
Martin Ziegler
ANTS
2004
Springer
106views Algorithms» more  ANTS 2004»
14 years 1 months ago
The Discrete Logarithm in Logarithmic -Class Groups and Its Applications in K-theory
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...
Sebastian Pauli, Florence Soriano-Gafiuk
MOC
2000
122views more  MOC 2000»
13 years 8 months ago
Explicit resolutions of cubic cusp singularities
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...
H. G. Grundman