Complexities for Generalized Models of Self-Assembly
DOI10.1137/S0097539704445202zbMath1088.68067OpenAlexW1990819744MaRDI QIDQ5317208
Gagan Aggarwal, Pablo Moisset de Espanés, Robert T. Schweller, Qi Cheng, Michael H. Goldwasser, Ming-Yang Kao
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704445202
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50) Combinatorial complexity of geometric structures (52C45)
Related Items