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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reconstruction of binary matrices under fixed size neighborhood constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of image reconstruction in discrete tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using graphs for some discrete tomography problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of reconstructing lattice sets from their \(X\)-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of determining polyatomic structures by X-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank

Latest revision as of 05:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Solving Some Instances of the 2-Color Problem
scientific article

    Statements

    Identifiers