The authors construct tile-assembly systems that conceal inputs and computational history, and use these to prove coNP-completeness of unique assembly verification in the growth-only negative-glue aTAM.
Arithmetic computation in the tile assembly model: Addition and multiplication
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Covert Computation in Self-Assembled Circuits
The authors construct tile-assembly systems that conceal inputs and computational history, and use these to prove coNP-completeness of unique assembly verification in the growth-only negative-glue aTAM.