Efficient 3-SAT algorithms in the tile assembly model (Q2629931): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexities for Generalized Models of 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: 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: Solving satisfiability in the tile assembly model with a constant-size tileset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path finding in the tile assembly model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error suppression mechanisms for DNA tile self-assembly and their simulation / 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: Q4375761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / 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: Q4283247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Self‐Assembled Shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 06:33, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficient 3-SAT algorithms in the tile assembly model
scientific article

    Statements

    Efficient 3-SAT algorithms in the tile assembly model (English)
    0 references
    0 references
    8 July 2016
    0 references
    self-assembly
    0 references
    3-SAT
    0 references
    efficient 3-SAT algorithms
    0 references
    tile-assembly model
    0 references

    Identifiers