Path Puzzles: Discrete Tomography with a Path Constraint is Hard

Author(s)
Bosboom, Jeffrey; Demaine, Erik D; Demaine, Martin L; Hesterberg, Adam; Kimball, Roderick; ... Show more
Thumbnail
Download373_2019_2092_ReferencePDF.pdf (700.1Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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$$3-Dimensional Matching.
Date issued
2019-09-26
URI
https://hdl.handle.net/1721.1/131806
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Publisher
Springer Japan
Collections