A Polynomial-Time DNA Computing Solution for the N-Queens Problem

被引：5
|
作者：
Maazallahi, Ramin [1 ]
Niknafs, Aliakbar [1 ]
Arabkhedri, Paria [1 ]
机构：
[1] Shahid Bahonar Univ Kerman, Dept Comp Engn, Kerman, Iran
来源：
2ND WORLD CONFERENCE ON EDUCATIONAL TECHNOLOGY RESEARCH | 2013年 / 83卷
关键词：
DNA computing; Adleman-Lipton Model; N-queens problem; NP-Complete; ALGORITHMS;
D O I：
10.1016/j.sbspro.2013.06.118
中图分类号：
G40 [教育学];
学科分类号：
040101 ; 120403 ;
摘要：
The N-queens problem is a classic combinatorial problem that there is no polynomial time solution for it in silicon based computers. It belongs to the set of NP-Complete problems and needs a plenty of calculations. On the other hand, it has been evidenced that DNA computing is able to solve such complex problems efficiently. In this paper we propose a method based on Adleman-Lipton model, a model of DNA computing, which is able to solve the N-queens problem in a polynomial time complexity. It provides all the solutions and runs in O(N-2). (C) 2013 The Authors. Published by Elsevier Ltd.
引用
收藏
页码：622 / 628
页数：7
相关论文
共 50 条
  • [41] MODELING THE N-QUEENS PROBLEM USING MATHEMATICAL SOFTWARE
    Alberdi Celaya, Elisabete
    Munoz Matute, Judit
    9TH INTERNATIONAL CONFERENCE ON EDUCATION AND NEW LEARNING TECHNOLOGIES (EDULEARN17), 2017, : 1321 - 1330
  • [42] Enhancing the Simulation of Membrane System on the GPU for the N-Queens Problem
    Muniyandi, Ravie Chandren
    Maroosi, All
    CHINESE JOURNAL OF ELECTRONICS, 2015, 24 (04) : 740 - 743
  • [43] Landscape analysis and efficient metaheuristics for solving the n-queens problem
    Masehian, Ellips
    Akbaripour, Hossein
    Mohabbati-Kalejahi, Nasrin
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (03) : 735 - 764
  • [44] Landscape analysis and efficient metaheuristics for solving the n-queens problem
    Ellips Masehian
    Hossein Akbaripour
    Nasrin Mohabbati-Kalejahi
    Computational Optimization and Applications, 2013, 56 : 735 - 764
  • [45] A High Order Neural Network to Solve N-Queens Problem
    Ding, Yuxin
    Li, Ye
    Xiao, Min
    Wang, Qing
    Dong, Li
    2010 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS IJCNN 2010, 2010,
  • [46] Enhancing the Simulation of Membrane System on the GPU for the N-Queens Problem
    Ravie Chandren Muniyandi
    Ali Maroosi
    Chinese Journal of Electronics, 2015, 24 (04) : 740 - 743
  • [47] A group-based search for solutions of the n-queens problem
    Engelhardt, Matthias R.
    DISCRETE MATHEMATICS, 2007, 307 (21) : 2535 - 2551
  • [48] An Efficient Parallel Hardware Scheme for Solving the N-Queens Problem
    Azuma, Yuuma
    Sakagami, Hayato
    Kise, Kenji
    2018 IEEE 12TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP (MCSOC 2018), 2018, : 16 - 22
  • [49] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
    KANNAN, R
    LIPTON, RJ
    JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
  • [50] Quantum computing, postselection, and probabilistic polynomial-time
    Aaronson, S
    PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2005, 461 (2063): : 3473 - 3482
12345