Path puzzles: discrete tomography with a path constraint is hard (Q2308497)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path puzzles: discrete tomography with a path constraint is hard |
scientific article |
Statements
Path puzzles: discrete tomography with a path constraint is hard (English)
0 references
3 April 2020
0 references
discrete tomography
0 references
ASP-completeness
0 references
\#P-completeness
0 references
3-dimensional matching
0 references
numerical 3-dimensional matching
0 references
