Path Puzzles: Discrete Tomography with a Path Constraint is Hard

03/03/2018
by   Jeffrey Bosboom, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/28/2022

MaxCut on Permutation Graphs is NP-complete

In this paper, we prove that the MaxCut problem is NP-complete on permut...
02/10/2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

We analyze the computational complexity of several new variants of edge-...
03/17/2020

NP-completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim of the graph burning ...
01/22/2021

Rikudo is NP-complete

Rikudo is a number-placement puzzle, where the player is asked to comple...
04/23/2020

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...
06/04/2019

Shellings from relative shellings, with an application to NP-completeness

Shellings of simplicial complexes have long been a useful tool in topolo...
09/26/2018

Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding

First proposed by Wang and Li in 2007, workflow resiliency is a policy a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.