Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658): Difference between revisions

@@ Property / cites work @@
+Q5434302
@@ Property / cites work: Q5434302 / rank @@
+Normal rank
@@ Property / cites work @@
+On tiling under tomographic constraints.
@@ Property / cites work: On tiling under tomographic constraints. / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
+Normal rank
@@ Property / cites work @@
+Tiling with bars under tomographic constraints.
@@ Property / cites work: Tiling with bars under tomographic constraints. / rank @@
+Normal rank
@@ Property / cites work @@
+The reconstruction of a subclass of domino tilings from two projections
+Normal rank
@@ Property / cites work @@
+On the computational complexity of determining polyatomic structures by X-rays
+Normal rank
@@ Property / cites work @@
+Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
+Normal rank
@@ Property / cites work @@
+Discrete tomography. Foundations, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Reconstruction of domino tiling from its two orthogonal projections
+Normal rank
@@ Property / cites work @@
+Matrices of zeros and ones
@@ Property / cites work: Matrices of zeros and ones / rank @@
+Normal rank