A computational DNA solution approach for the quadratic Diophantine equation (Q275220): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Molecular solution to the 0-1 knapsack problem based on DNA computing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A DNA-based graph encoding scheme with its applications to graph isomorphism problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-complete decision problems for binary quadratics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time DNA computing solution for the bin-packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4737646 / rank | |||
Normal rank | |||
Latest revision as of 21:18, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational DNA solution approach for the quadratic Diophantine equation |
scientific article |
Statements
A computational DNA solution approach for the quadratic Diophantine equation (English)
0 references
25 April 2016
0 references
DNA computing
0 references
quadratic Diophantine equation
0 references
NP-complete
0 references
parallel algorithm
0 references
0 references
