A computational DNA solution approach for the Quadratic Diophantine Equation

作者：Alonso Sanches Carlos Alberto; Soma Nei Yoshihiro

来源：Applied Mathematics and Computation, 2014, 238: 436-443.

DOI：10.1016/j.amc.2014.04.022

• DNA computing
• Quadratic Diophantine Equation
• NP-Complete
• Parallel algorithm

We present a fast parallel algorithm based on stickers for the DNA computing model to solve the classical mathematical Quadratic Diophantine Equation: ax(2) + by = c, with a, b, c, x, y is an element of Z(+). This problem, also in a decision form, is NP-Complete, and has no known polynomial-time solving within the Deterministic Turing Machine model.

• 出版日期2014-7-1