Sciweavers

ARSCOM
2004
72views more  ARSCOM 2004»
13 years 11 months ago
Exponential lower bounds for the numbers of Skolem-type sequences
It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 ...
G. K. Bennett, Mike J. Grannell, Terry S. Griggs
DAM
2010
89views more  DAM 2010»
13 years 11 months ago
A note on the hardness of Skolem-type sequences
The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the ex...
Gustav Nordh