Solving satisfiability in the tile assembly model with a constant-size tileset
DOI10.1016/j.jalgor.2008.07.002zbMath1162.68446OpenAlexW2069829999MaRDI QIDQ3543477
Publication date: 3 December 2008
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2008.07.002
parallel computingNP-completedistributed computingsatisfiabilityself-assemblytile assembly model3-SATnatural computationmolecular computationcrystal-growth
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
This page was built for publication: Solving satisfiability in the tile assembly model with a constant-size tileset