The Complexity of Some Combinatorial Puzzles
Holger Petersen
TL;DR
This paper proves that the decision problems for the puzzles Knossos and The Hour-Glass are NP-complete, establishing their computational complexity as being as hard as the hardest problems in NP.
Contribution
It demonstrates the NP-completeness of the decision versions of Knossos and The Hour-Glass puzzles, providing new complexity results for these combinatorial puzzles.
Findings
Knossos decision problem is NP-complete
The Hour-Glass decision problem is NP-complete
Establishes computational difficulty of these puzzles
Abstract
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Mathematical Theories