Solving Some Instances of the 2-Color Problem (Q3648811): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-04397-0_43
+Normal rank
@@ Property / OpenAlex ID @@
+W2170873820
@@ Property / OpenAlex ID: W2170873820 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of binary matrices under fixed size neighborhood constraints
+Normal rank
@@ Property / cites work @@
+Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
+Normal rank
@@ Property / cites work @@
+A solvable case of image reconstruction in discrete tomography
+Normal rank
@@ Property / cites work @@
+Using graphs for some discrete tomography problems
+Normal rank
@@ Property / cites work @@
+Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
+Normal rank
@@ Property / cites work @@
+On the computational complexity of reconstructing lattice sets from their \(X\)-rays
+Normal rank
@@ Property / cites work @@
+On the computational complexity of determining polyatomic structures by X-rays
+Normal rank
@@ Property / cites work @@
+Discrete tomography. Foundations, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Combinatorial Properties of Matrices of Zeros and                         Ones
+Normal rank