Rule set design problems for oritatami systems (Q529023): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.09.010 / rank
Normal rank
 
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.2016.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2523042949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of Boolean networks: hardness results and algorithms for tree structured networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Biomolecules That Fold Greedily During Transcription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.09.010 / rank
 
Normal rank

Latest revision as of 20:35, 9 December 2024

scientific article
Language Label Description Also known as
English
Rule set design problems for oritatami systems
scientific article

    Statements

    Rule set design problems for oritatami systems (English)
    0 references
    0 references
    0 references
    18 May 2017
    0 references
    co-transcriptional folding
    0 references
    oritatami system
    0 references
    algorithmic self-assembly
    0 references
    time complexity
    0 references
    linear-time 2SAT solver
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references