Covert computation in self-assembled circuits (Q2659769): 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: Arithmetic computation in the tile assembly model: addition and multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative interactions in irreversible self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast arithmetic in algorithmic self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-assembly of shapes at constant scale using repulsive forces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to tile-based self-assembly and a survey of recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of graph self-assembly in accretive systems and self-destructible systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuel Efficient Computation in Passive Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minesweeper may not be NP-complete but is hard nonetheless / rank
 
Normal rank

Revision as of 20:51, 24 July 2024

scientific article
Language Label Description Also known as
English
Covert computation in self-assembled circuits
scientific article

    Statements

    Covert computation in self-assembled circuits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2021
    0 references
    self-assembly
    0 references
    covert computation
    0 references
    atam
    0 references

    Identifiers