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
关键词
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 条
  • [21] A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors
    Arroyo Montoro, Fernando
    Gomez-Canaval, Sandra
    Jimenez Vega, Karina
    Ortega de la Puente, Alfonso
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (01) : 7 - 21
  • [22] DIVIDE AND CONQUER UNDER GLOBAL CONSTRAINTS - A SOLUTION TO THE N-QUEENS PROBLEM
    ABRAMSON, B
    YUNG, M
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 6 (03) : 649 - 662
  • [23] A novel approach to solving N-queens problem
    Kaosar, G
    Shorfuzzaman, M
    Ahmed, S
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING, 2004, : 186 - 190
  • [24] Regular solutions of the n-queens problem on the torus
    Burger, AP
    Mynhardt, CM
    Cockayne, EJ
    UTILITAS MATHEMATICA, 2004, 65 : 219 - 230
  • [25] Accelerated Simulation of Membrane Computing to Solve the N-queens Problem on Multi-core
    Maroosi, Ali
    Muniyandi, Ravie Chandren
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT II (SEMCCO 2013), 2013, 8298 : 257 - 267
  • [26] The N-queens Problem on a symmetric Toeplitz matrix
    Szaniszlo, Zsuzsanna
    Tomova, Maggy
    Wyels, Cindy
    DISCRETE MATHEMATICS, 2009, 309 (04) : 969 - 974
  • [27] Neural networks for the N-Queens Problem: a review
    Mandziuk, J
    CONTROL AND CYBERNETICS, 2002, 31 (02): : 217 - 248
  • [28] THE MODULAR N-QUEENS PROBLEM IN HIGHER DIMENSIONS
    NUDELMAN, SP
    DISCRETE MATHEMATICS, 1995, 146 (1-3) : 159 - 167
  • [29] An improved genetic algorithm for the n-queens problem
    Hynek, J
    IC-AI'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 1-III, 2000, : 517 - 522
  • [30] Results for the n-queens problem on the Mobius board
    Bell, Jordan
    Stevens, Brett
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 21 - 34