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 条

[1] A polynomial time algorithm for the n-queens problem
El-Qawasmeh, E
Al-Noubani, K
Proceedings of the Second IASTED International Conference on Neural Networks and Computational Intelligence, 2004, : 191 - 195
[2] A polynomial-time DNA computing solution for the Bin-Packing Problem
Alonso Sanches, Carlos Alberto
Soma, Nei Yoshihiro
APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (06) : 2055 - 2062
[3] A SIMPLIFIED SOLUTION OF THE N-QUEENS PROBLEM
REICHLING, M
INFORMATION PROCESSING LETTERS, 1987, 25 (04) : 253 - 255
[4] THE N-QUEENS PROBLEM
RIVIN, I
VARDI, I
ZIMMERMANN, P
AMERICAN MATHEMATICAL MONTHLY, 1994, 101 (07): : 629 - 639
[5] N-QUEENS PROBLEM
BRUEN, A
DIXON, R
DISCRETE MATHEMATICS, 1975, 12 (04) : 393 - 395
[6] Reducing the time complexity of the n-queens problem
El-Qawasmeh, E
Al-Noubani, K
INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2005, 14 (03) : 545 - 557
[7] A DYNAMIC-PROGRAMMING SOLUTION TO THE N-QUEENS PROBLEM
RIVIN, I
ZABIH, R
INFORMATION PROCESSING LETTERS, 1992, 41 (05) : 253 - 256
[8] The n-queens completion problem
Stefan Glock
David Munhá Correia
Benny Sudakov
Research in the Mathematical Sciences, 2022, 9
[9] Polynomial modular n-queens solutions
Bell, Jordan
ACTA ARITHMETICA, 2007, 129 (04) : 335 - 339
[10] N-Queens Problem Resolution Using the Quantum Computing Model
de Souza, F. J.
de Mello, F. L.
IEEE LATIN AMERICA TRANSACTIONS, 2017, 15 (03) : 534 - 540

← 1 2 3 4 5 →