| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4627966 | Applied Mathematics and Computation | 2014 | 8 Pages |
Abstract
We present a fast parallel algorithm based on stickers for the DNA computing model to solve the classical mathematical Quadratic Diophantine Equation : ax2+by=cax2+by=c, with a,b,c,x,y∈Z+a,b,c,x,y∈Z+. This problem, also in a decision form, is NP-Complete, and has no known polynomial-time solving within the Deterministic Turing Machine model.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,