Nondeterministic polynomial time factoring in the tile assembly model

DOI10.1016/j.tcs.2007.07.051zbMath1146.68064OpenAlexW2036058103MaRDI QIDQ924676

Yuriy Brun

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

zbMATH Keywords

parallel computingdistributed computingcrystal growthself-assemblytile assembly modelfactoringnondeterministic computationnatural computationmolecular computation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Efficient 3-SAT algorithms in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ Improving Efficiency of 3-SAT-Solving Tile Systems ⋮ Path finding in the tile assembly model

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

This page was built for publication: Nondeterministic polynomial time factoring in the tile assembly model