A note on the hardness of Skolem-type sequences (Q972331)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5711863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the hardness of Skolem-type sequences |
scientific article; zbMATH DE number 5711863 |
Statements
A note on the hardness of Skolem-type sequences (English)
0 references
25 May 2010
0 references
Skolem sequence
0 references
\(\mathbf{NP}\)-completeness
0 references
coupled task scheduling
0 references
0 references
0.9246549606323242
0 references
0.8440628051757812
0 references
0.7529157996177673
0 references
