The complexity of fixed-height patterned tile self-assembly

DOI10.1142/S0129054117400020MaRDI QIDQ6828850zbMATH OpenFDO

Authors Shinnosuke Seki, Andrew Winslow

Publication date 22 February 2018

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054117400020

zbMATH Keywords

DNA patterned tile self-assemblyfinite state transducerfixed-height patternNP-hardnesspolynomial-time algorithm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40)

This page was built for publication: The complexity of fixed-height patterned tile self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828850)