Abstract
Pattern self-assembly tile set synthesis (Pats) is an NP-hard combinatorial problem to minimize a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern. For c ≥ 1, c-Pats is a subproblem of Pats which takes only the patterns with at most c colors as input. We propose a polynomial-time reduction of 3Sat to 60-Pats in order to prove that 60-Pats is NP-hard. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Seki, S. (2013). Combinatorial optimization in pattern assembly (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7956 LNCS, pp. 220–231). Springer Verlag. https://doi.org/10.1007/978-3-642-39074-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
