Solving NP-complete problems in the tile assembly model (Q924678): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967232959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running time and program size for self-assembled squares / 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: DNA Computing / 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: Q4529973 / 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: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / 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: Q3392273 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:15, 28 June 2024

scientific article
Language Label Description Also known as
English
Solving NP-complete problems in the tile assembly model
scientific article

    Statements

    Solving NP-complete problems in the tile assembly model (English)
    0 references
    0 references
    19 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    self-assembly
    0 references
    NP-complete
    0 references
    tile assembly model
    0 references
    crystal-growth
    0 references
    molecular computation
    0 references
    natural computation
    0 references
    distributed computing
    0 references
    parallel computing
    0 references
    nondeterministic computation
    0 references
    subsetsum
    0 references
    0 references