A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10878-015-9975-6 / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6687846 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
DNA pattern self-assembly | |||
Property / zbMATH Keywords: DNA pattern self-assembly / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tile complexity | |||
Property / zbMATH Keywords: tile complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
manually-checkable proof | |||
Property / zbMATH Keywords: manually-checkable proof / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1484881446 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1409.1619 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving NP-complete problems in the tile assembly model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving satisfiability in the tile assembly model with a constant-size tileset / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient 3-SAT algorithms in the tile assembly model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DNA Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4371018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Search methods for tile sets in patterned DNA self-assembly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Minimum Tile Sets to Self-Assemble Color Patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary pattern tile set synthesis is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-Color Bounded Patterned Self-assembly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Optimization in Pattern Assembly / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10878-015-9975-6 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:00, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis |
scientific article |
Statements
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (English)
0 references
22 February 2017
0 references
DNA pattern self-assembly
0 references
tile complexity
0 references
manually-checkable proof
0 references
0 references