Sciweavers

2 search results - page 1 / 1
» NP-completeness of generalized multi-Skolem sequences
Sort
View
64
Voted
DAM
2010
89views more  DAM 2010»
14 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
73
Voted
DAM
2007
67views more  DAM 2007»
14 years 10 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh