A. Mirzaei

Learn More
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP-hard. It has been evidenced that DNA computing can solve those problems which are currently intractable on even fastest electronic computers. This paper proposes a new DNA algorithm for solving N-Queen problem, a complex(More)
  • 1