Date of Graduation
5-2018
Document Type
Thesis
Degree Name
Bachelor of Science
Degree Level
Undergraduate
Department
Computer Science and Computer Engineering
Advisor/Mentor
Patitz, Matthew
Committee Member/Reader
Beavers, Gordon
Committee Member/Second Reader
Gauch, Susan
Abstract
In this paper, we discuss a tile-based self-assembly model called the Folding Tile Assembly Model (FTAM). We briefly define what makes the FTAM unique in its ability to have folding 2D tiles. We also discuss the difficulty of determining the computational complexity of certain FTAM properties despite it being simpler for less dynamic models. Specifically, we discuss the property of rigidity in FTAM assemblies by devising a simple definition of rigidity, so that it is easier to determine its complexity. We use a reduction between an assembly and a 3SAT instance along with a series of proofs to give a result that shows it is co-NP-complete to determine whether a given assembly is rigid.
Keywords
tile, self-assembly, folding, reconfigurability, 3-dimensional
Citation
Perkins, I. (2018). Computational Complexity of Determining the Rigidity of FTAM Assemblies. Computer Science and Computer Engineering Undergraduate Honors Theses Retrieved from https://scholarworks.uark.edu/csceuht/48