scientific article; zbMATH DE number 1568805
From MaRDI portal
Publication:4762326
zbMath0969.68085MaRDI QIDQ4762326
Thomas H. LaBean, Michail G. Lagoudakis
Publication date: 21 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items
Efficient 3-SAT algorithms in the tile assembly model ⋮ Capabilities and limits of compact error resilience methods for algorithmic self-assembly ⋮ Verification in staged tile self-assembly ⋮ Nondeterministic polynomial time factoring in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ On the complexity of graph self-assembly in accretive systems ⋮ A minimal requirement for self-assembly of lines in polylogarithmic time ⋮ Polyomino-safe DNA self-assembly via block replacement ⋮ The emerging discipline of biomolecular computation in the US ⋮ Improving Efficiency of 3-SAT-Solving Tile Systems ⋮ Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems ⋮ A Self-assembly Model of Time-Dependent Glue Strength ⋮ Complexity of Compact Proofreading for Self-assembled Patterns ⋮ Path finding in the tile assembly model ⋮ Self-assembly of strings and languages ⋮ Polyomino-Safe DNA Self-assembly via Block Replacement
