15 search results - page 1 / 3 » On Euclid's algorithm and elementary number theory |
SCP
2011
12 years 12 months ago
2011
SIAMCOMP
2008
13 years 4 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
CPM
2001
Springer
13 years 9 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
IPL
2008
13 years 4 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
MOC
2002
13 years 4 months ago
2002
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...