Solving NP-complete problems in the tile assembly model (Q924678): Difference between revisions
From MaRDI portal
Latest revision as of 09:15, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving NP-complete problems in the tile assembly model |
scientific article |
Statements
Solving NP-complete problems in the tile assembly model (English)
0 references
19 May 2008
0 references
self-assembly
0 references
NP-complete
0 references
tile assembly model
0 references
crystal-growth
0 references
molecular computation
0 references
natural computation
0 references
distributed computing
0 references
parallel computing
0 references
nondeterministic computation
0 references
subsetsum
0 references
0 references