Nondeterministic polynomial time factoring in the tile assembly model
From MaRDI portal
Publication:924676
DOI10.1016/j.tcs.2007.07.051zbMath1146.68064MaRDI QIDQ924676
Publication date: 19 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.051
parallel computing; distributed computing; crystal growth; self-assembly; tile assembly model; factoring; nondeterministic computation; natural computation; molecular computation
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Solving NP-complete problems in the tile assembly model, Path finding in the tile assembly model, Efficient 3-SAT algorithms in the tile assembly model, Improving Efficiency of 3-SAT-Solving Tile Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetic computation in the tile assembly model: addition and multiplication
- Undecidability and nonperiodicity for tilings of the plane
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Reducing tile complexity for self-assembly through temperature programming
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing
- DNA Computing