On the complexity of graph self-assembly in accretive systems (Q934978): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s11047-007-9048-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034199804 / 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: Combinatorial optimization problems in self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501351 / 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: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconventional Computation / 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: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / 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: Self-assembling DNA graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmable Control of Nucleation for Algorithmic Self-Assembly / 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

Latest revision as of 14:02, 28 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of graph self-assembly in accretive systems
scientific article

    Statements

    On the complexity of graph self-assembly in accretive systems (English)
    0 references
    0 references
    0 references
    0 references
    31 July 2008
    0 references
    0 references
    graph self-assembly
    0 references
    accretive systems
    0 references
    computational complexity
    0 references
    0 references