A computational DNA solution approach for the quadratic Diophantine equation

DOI10.1016/j.amc.2014.04.022zbMath1334.11094OpenAlexW2004192306MaRDI QIDQ275220

Nei Yoshihiro Soma, Carlos Alberto Alonso Sanches

Publication date: 25 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.04.022

zbMATH Keywords

quadratic Diophantine equationparallel algorithmDNA computingNP-complete

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Computational number theory (11Y99)

Related Items (2)

Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Diophantine approximation over primes with different powers

Cites Work

• Molecular solution to the 0-1 knapsack problem based on DNA computing
• A polynomial-time DNA computing solution for the bin-packing problem
• NP-complete decision problems for binary quadratics
• A DNA-based graph encoding scheme with its applications to graph isomorphism problems
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational DNA solution approach for the quadratic Diophantine equation