Tile Complexity of Linear Assemblies
DOI10.1137/110822487zbMath1253.68133OpenAlexW2064995304MaRDI QIDQ3143302
Harish Chandran, Nikhil Gopalkrishnan, John H. Reif
Publication date: 29 November 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110822487
self-assemblyDNA tilestile assembly modeltile complexityWang tilings\(\kappa\)-pad systemslinear assembliesprobabilistic tile assembly model
Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items