Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem (Q5458907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem |
scientific article; zbMATH DE number 5267374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem |
scientific article; zbMATH DE number 5267374 |
Statements
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem (English)
0 references
24 April 2008
0 references
discrete tomography
0 references
polynomial-time reduction
0 references
NP-complete problem
0 references
0.8761070966720581
0 references
0.8663326501846313
0 references
0.84679114818573
0 references
0.8402733206748962
0 references
