Treffer: Verification in staged tile self-assembly.

We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are coNPNP-hard and contained in PSPACE (and in Π2sP for staged systems with s stages). En route, we prove that unique shape verification problem in the 2HAM is coNPNP-complete. [ABSTRACT FROM AUTHOR]

Copyright of Natural Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)