The Complexity of Some Combinatorial Puzzles

preprint2015arXivOpen access

Abstract

We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.