Efficient 3-SAT algorithms in the tile assembly model
From MaRDI portal
Publication:2629931
DOI10.1007/s11047-011-9299-0zbMath1362.68100OpenAlexW2075438117MaRDI QIDQ2629931
Publication date: 8 July 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-011-9299-0
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error suppression mechanisms for DNA tile self-assembly and their simulation
- Arithmetic computation in the tile assembly model: addition and multiplication
- Nondeterministic polynomial time factoring in the tile assembly model
- Solving NP-complete problems in the tile assembly model
- Path finding in the tile assembly model
- Solving satisfiability in less than \(2^ n\) steps
- New methods for 3-SAT decision and worst-case analysis
- Undecidability and nonperiodicity for tilings of the plane
- The program-size complexity of self-assembled squares (extended abstract)
- Solving satisfiability in the tile assembly model with a constant-size tileset
- Reducing tile complexity for self-assembly through temperature programming
- Complexities for Generalized Models of Self-Assembly
- Complexity of Self‐Assembled Shapes
- Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
- DNA Computing
This page was built for publication: Efficient 3-SAT algorithms in the tile assembly model
