A computational DNA solution approach for the Quadratic Diophantine Equation

We present a fast parallel algorithm based on stickers for the DNA computing model to solve the classical mathematical Quadratic Diophantine Equation: ${\mathit{ax}}^2+\mathit{by}=c$ , with $a\text{,}b\text{,}c\text{,}x\text{,}y\in {\mathcal{Z}}^{+}$ . This problem, also in a decision form, is NP‐Complete, and has no known polynomial‐time solving within the Deterministic Turing Machine model.