Abstract
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular pattern. For k ≥ 1, k-PATS is a variant of PATS that restricts input patterns to those with at most k colors. We prove the NP-hardness of 29-PATS, where the best known is that of 60-PATS. © 2013 Springer-Verlag.
Cite
CITATION STYLE
APA
Johnsen, A. C., Kao, M. Y., & Seki, S. (2013). Computing minimum tile sets to self-assemble color patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 699–710). https://doi.org/10.1007/978-3-642-45030-3_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free