Using sticker to solve the 3-dimensional matching problem in molecular supercomputers (Q3549251): 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:08, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using sticker to solve the 3-dimensional matching problem in molecular supercomputers |
scientific article |
Statements
Using sticker to solve the 3-dimensional matching problem in molecular supercomputers (English)
0 references
21 December 2008
0 references
molecular supercomputing
0 references
DNA-based parallel algorithms
0 references
NP-complete Hamiltonian path problem
0 references
parallel computing
0 references
three-dimensional matching
0 references
3D matching
0 references
NP-complete satisfiability
0 references
sticker
0 references
simulation
0 references
high performance computing
0 references
