Path Puzzles: Discrete Tomography with a Path Constraint is Hard
classification
💻 cs.CG
keywords
pathdimensionaldiscretematchingpuzzlestomographyalongasp-complete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.