The following pages link to DNA Computing (Q5717646):
Displayed 15 items.
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Error suppression mechanisms for DNA tile self-assembly and their simulation (Q734204) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- Toward minimum size self-assembled counters (Q941685) (← links)
- Path finding in the tile assembly model (Q1008725) (← links)
- Simple evolution of complex crystal species (Q2629929) (← links)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems (Q3618692) (← links)
- A Self-assembly Model of Time-Dependent Glue Strength (Q3618693) (← links)
- Complexity of Compact Proofreading for Self-assembled Patterns (Q3618694) (← links)
- Connecting the Dots: Molecular Machinery for Distributed Robotics (Q3643096) (← links)
- Iterative Self-assembly with Dynamic Strength Transformation and Temperature Control (Q5168506) (← links)