On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays (Q5955125): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:10, 30 January 2024
scientific article; zbMATH DE number 1703195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays |
scientific article; zbMATH DE number 1703195 |
Statements
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays (English)
0 references
7 February 2002
0 references
computational complexity
0 references
NP-hardness
0 references
discrete tomography problem
0 references
reconstruction
0 references
greedy algorithms
0 references
