Tile complexity of approximate squares
From MaRDI portal
Publication:1949754
DOI10.1007/S00453-012-9620-ZzbMATH Open1262.68185OpenAlexW2018891418MaRDI QIDQ1949754FDOQ1949754
Authors: Harish Chandran, Nikhil Gopalkrishnan, J. Reif 
Publication date: 16 May 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9620-z
Recommendations
- Tile Complexity of Linear Assemblies
- Aspects of a multivariate complexity analysis for rectangle tiling
- Complexity of tile rotation problems
- A PTAS for the square tiling problem
- The Tile Complexity of Linear Assemblies
- Tiling of rectangles with squares and related problems via Diophantine approximation
- The complexity of generalized domino tilings
- Tiling with Squares and Packing Dominos in Polynomial Time
- Polyhedron approximation of tile set
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- Programmable control of nucleation for algorithmic self-assembly
- The Tile Complexity of Linear Assemblies
- Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
- Title not available (Why is that?)
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Randomized self-assembly for exact shapes
- DNA Computing
- Limitations of self-assembly at temperature 1
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- The undecidability of the domino problem
- Title not available (Why is that?)
- Reducing tile complexity for self-assembly through temperature programming
- DNA Computing
- DNA Computing
Cited In (8)
- High Complexity Tilings with Sparse Errors
- Program size and temperature in self-assembly
- Aspects of a multivariate complexity analysis for rectangle tiling
- Randomized self-assembly for exact shapes
- Tile Complexity of Linear Assemblies
- Randomized Self-assembly for Approximate Shapes
- Parallel Computation Using Active Self-assembly
- Parallel computation using active self-assembly
This page was built for publication: Tile complexity of approximate squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949754)
