Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Computational Geometry
2019-02-12 v2
Abstract
We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly establish ASP-completeness and #P-completeness for 3-Dimensional Matching and Numerical 3-Dimensional Matching.
Cite
@article{arxiv.1803.01176,
title = {Path Puzzles: Discrete Tomography with a Path Constraint is Hard},
author = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Roderick Kimball and Justin Kopinsky},
journal= {arXiv preprint arXiv:1803.01176},
year = {2019}
}
Comments
16 pages, 8 figures. Revised proof of Theorem 2.4. 2-page abstract appeared in Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2017)