Path finding in the tile assembly model (Q1008725): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial optimization problems in self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities for Generalized Models of Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-correcting Self-assembly: Growth Models and the Hammersley Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic computation in the tile assembly model: addition and multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic polynomial time factoring in the tile assembly model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving NP-complete problems in the tile assembly model / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability Of Some Domino Connectability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3767336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solvability of domino snake problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing tile complexity for self-assembly through temperature programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and nonperiodicity for tilings of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The program-size complexity of self-assembled squares (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank

Latest revision as of 05:38, 29 June 2024

scientific article
Language Label Description Also known as
English
Path finding in the tile assembly model
scientific article

    Statements

    Path finding in the tile assembly model (English)
    0 references
    0 references
    0 references
    30 March 2009
    0 references
    0 references
    self-assembly
    0 references
    tile assembly model
    0 references
    amorphous computing
    0 references
    swarm computing
    0 references
    robotics
    0 references
    crystal growth
    0 references
    molecular computation
    0 references
    natural computation
    0 references
    path-finding
    0 references
    0 references