Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Name
373_2019_2092_ReferencePDF.pdf
Size
700.18 KB
Format
Adobe PDF
Checksum (MD5)
fdabaddb8c383ad2105315793e504702
Author(s)
Bosboom, Jeffrey
Demaine, Erik D
Demaine, Martin L
Hesterberg, Adam
Kimball, Roderick
Kopinsky, Justin
Date Issued
September 26, 2019
Publisher
Springer Japan
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00373-019-02092-5
