The Complexity of Some Combinatorial Puzzles
Computational Complexity
2015-08-03 v1
Authors:
Holger Petersen
Abstract
We show that the decision versions of the puzzles Knossos and The Hour-Glass are complete for NP.
Cite
@article{arxiv.1507.08690,
title = {The Complexity of Some Combinatorial Puzzles},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1507.08690},
year = {2015}
}
Related papers
View all related →
Computational Complexity · Computer Science
Complexity Results of Persuasion
Alban Grastien
2025-07-09
Computational Complexity · Computer Science
An NL-Complete Puzzle
Holger Petersen
2015-07-13
Discrete Mathematics · Computer Science
Slant/Gokigen Naname is NP-complete, and Some Variations are in P
Jayson Lynch, Jack Spalding-Jamieson
2025-02-20
Group Theory · Mathematics
Quadratic equations over free groups are NP-complete
O. Kharlampovich, I. G. Lysenok, A. G Myasnikov, N. W. M. Touikan
2014-03-27
Computational Geometry · Computer Science
Recognition of collapsible complexes is NP-complete
Martin Tancer
2015-10-08
Group Theory · Mathematics
Knapsack Problems in Groups
Alexei Myasnikov, Andrey Nikolaev, Alexander Ushakov
2015-08-12
Computational Geometry · Computer Science
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell +5
2019-04-09
Number Theory · Mathematics
Complexity of strong approximation on the sphere
Naser T Sardari
2018-09-06
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Group Theory · Mathematics
Compressed decision problems in hyperbolic groups
Derek Holt, Markus Lohrey, Saul Schleimer
2024-03-22
Optimization and Control · Mathematics
The Complexity of Recognizing Facets for the Knapsack Polytope
Rui Chen, Haoran Zhu
2025-10-21
Data Structures and Algorithms · Computer Science
Complexity dichotomy on partial grid recognition
Vinícius G. P. de Sá, Guilherme D. da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2012-04-13
Representation Theory · Mathematics
The Quiver Problem is NP Complete
Victor Kac, Bangzheng Li
2025-08-06
Computational Complexity · Computer Science
On the Computational Complexity of Generalized Common Shape Puzzles
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
2023-05-19
Computational Geometry · Computer Science
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg +2
2019-02-12
Computational Complexity · Computer Science
P not equal to NP
Daniel Cardona Delgado
2024-01-30
Computational Complexity · Computer Science
On planar variants of the monotone satisfiability problem with bounded variable appearances
Andreas Darmann, Janosch Döcker, Britta Dorn
2016-04-20
Computational Complexity · Computer Science
Polynomially Correlated Knapsack is NP-complete
Chinmay Karande
2009-10-15
Discrete Mathematics · Computer Science
The complexity of UNO
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara +2
2013-12-03
Computational Complexity · Computer Science
Yin-Yang Puzzles are NP-complete
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021-06-30
Computational Complexity · Computer Science
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
Dorothea Baumeister, Joerg Rothe
2008-06-09
Discrete Mathematics · Computer Science
On Strong NP-Completeness of Rational Problems
Dominik Wojtczak
2018-02-27
Group Theory · Mathematics
The complexity of intersecting subproducts with subgroups in Cartesian powers
Pim Spelier
2025-07-01
General Mathematics · Mathematics
A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
Petar P. Petrov
2024-08-23
Computer Science and Game Theory · Computer Science
On the Complexity of Deciding Degeneracy in Games
Ye Du
2009-05-20