4 search results - page 1 / 1 » Upper bounds for the prime divisors of Wendt's determinant |
MOC
2002
13 years 4 months ago
2002
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
IANDC
2008
13 years 4 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
JALC
2007
13 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...