Combinatorial Optimization in Pattern Assembly
From MaRDI portal
Publication:5300928
DOI10.1007/978-3-642-39074-6_21zbMath1381.68101OpenAlexW1501103043MaRDI QIDQ5300928
Publication date: 28 June 2013
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39074-6_21
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Search methods for tile sets in patterned DNA self-assembly ⋮ A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis ⋮ Binary pattern tile set synthesis is NP-hard ⋮ 3-Color Bounded Patterned Self-assembly ⋮ 3-color bounded patterned self-assembly ⋮ The Complexity of Fixed-Height Patterned Tile Self-assembly ⋮ An introduction to tile-based self-assembly and a survey of recent results
This page was built for publication: Combinatorial Optimization in Pattern Assembly
