Solving the minimum bisection problem using a biologically inspired computational model (Q847667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DNA models and algorithms for NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strand design for biomolecular computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875219 / rank
 
Normal rank

Latest revision as of 12:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Solving the minimum bisection problem using a biologically inspired computational model
scientific article

    Statements

    Solving the minimum bisection problem using a biologically inspired computational model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    0 references
    DNA algorithm
    0 references
    Adleman-Lipton-Sticker model
    0 references
    minimum bisection problem
    0 references
    0 references