A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors

DOI10.1142/S0129054120400018zbMath1430.68110OpenAlexW3003186056MaRDI QIDQ5217111

Alfonso Ortega de la Puente, Fernando Arroyo Montoro, Karina Jiménez Vega, Sandra Gómez Canaval

Publication date: 21 February 2020

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120400018

zbMATH Keywords

combinatorial optimization problems\(N\)-queens problembio-inspired computational modelgeneralized networks of polarized evolutionary processorsmassively parallel and distributed algorithmsnetworks of polarized evolutionary processors

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
• On the computational power of networks of polarized evolutionary processors
• Accepting networks of splicing processors: complexity results
• Networks of polarized evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• A survey of known results and research areas for \(n\)-queens
• Networks of evolutionary processors
• Networks of splicing processors with evaluation sets as optimization problems solvers
• A group-based search for solutions of the \(n\)-queens problem
• Depth-First Search with P Systems
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• On the size complexity of universal accepting hybrid networks of evolutionary processors