Computing Minimum Tile Sets to Self-Assemble Colors Patterns
Computational Complexity
2014-04-14 v1
Abstract
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For , -PATS is a variant of PATS that restricts input patterns to those with at most colors. We prove the {\bf NP}-hardness of 29-PATS, where the best known is that of 60-PATS.
Keywords
Cite
@article{arxiv.1404.2962,
title = {Computing Minimum Tile Sets to Self-Assemble Colors Patterns},
author = {Aleck C. Johnsen and Ming-Yang Kao and Shinnosuke Seki},
journal= {arXiv preprint arXiv:1404.2962},
year = {2014}
}