liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A note on the hardness of Skolem-type sequences
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2010 (English)In: DISCRETE APPLIED MATHEMATICS, ISSN 0166-218X, Vol. 158, no 8, 964-966 p.Article in journal (Refereed) Published
Abstract [en]

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 existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly NP-complete. These results are significant strengthenings and simplifications of the recent NP-completeness result for generalized multi-Skolem sequences.

Place, publisher, year, edition, pages
Elsevier Science B.V., Amsterdam. , 2010. Vol. 158, no 8, 964-966 p.
Keyword [en]
Skolem sequence, NP-completeness, Coupled task scheduling
National Category
Computer Science
URN: urn:nbn:se:liu:diva-56302DOI: 10.1016/j.dam.2010.01.006ISI: 000276941800010OAI: diva2:318303
Available from: 2010-05-07 Created: 2010-05-07 Last updated: 2010-12-29

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Nordh, Gustav
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link