The Complexity of Some Combinatorial Puzzles
classification
💻 cs.CC
keywords
puzzlescombinatorialcompletecomplexitydecisionhour-glassknossossome
read the original abstract
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.