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: ax2+by=c, with 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.