A note on the hardness of Skolem-type sequences
From MaRDI portal
(Redirected from Publication:972331)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 682566 (Why is no real title available?)
- Extended Langford sequences with small defects
- Extended skolem sequences
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
- On certain distributions of integers in pairs with given differences
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Perfect Skolem sets
- The complexity of completing partial Latin squares
- The existence of (p,q)-extended Rosa sequences
- \(\mathcal{NP}\)-completeness of generalized multi-Skolem sequences
Cited in
(4)
This page was built for publication: A note on the hardness of Skolem-type sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972331)