Verification in staged tile self-assembly

Authors

Robert Schweller, The University of Texas Rio Grande ValleyFollow
Andrew Winslow, The University of Texas Rio Grande Valley
Tim Wylie, The University of Texas Rio Grande ValleyFollow

Document Type

Article

Publication Date

3-15-2019

Abstract

We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are \textsf {coNP}^{\textsf {NP}}-hard and contained in PSPACE (and in \mathrm {\Pi }^\textsf {P}_{2s} for staged systems with s stages). En route, we prove that unique shape verification problem in the 2HAM is \textsf {coNP}^{\textsf {NP}}-complete.

Comments

Copyright © 2018, Springer Nature B.V.

https://rdcu.be/dW3PI

Recommended Citation

Schweller, Robert, Andrew Winslow, and Tim Wylie. "Verification in staged tile self-assembly." Natural Computing 18 (2019): 107-117. https://doi.org/10.1007/s11047-018-9701-2

Publication Title

Natural Computing

DOI

https://doi.org/10.1007/s11047-018-9701-2