Path Puzzles: Discrete Tomography with a Path Constraint is Hard

Jeffrey Bosboom,Erik D. Demaine,Martin L. Demaine,Adam Hesterberg, Roderick Kimball,Justin Kopinsky

Graphs and Combinatorics（2019）

引用 0|浏览97

暂无评分

摘要

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 .

查看译文

关键词

Discrete tomography, ASP-completeness, #P-completeness, 3-Dimensional Matching , Numerical 3-Dimensional Matching

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要