2015/07/30 by Holger Petersen, Petersen, Holger
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
paper · pdf · doi:10.48550/arxiv.1507.08690
arxiv created 2015/07/30 · arxiv updated 2015/08/03
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.