Fetching the paper…
Reading the bibliography…
Quantum computers can potentially solve problems that are computationally intractable on a classical computer in polynomial time using quantum-mechanical effects such as superposition and entanglement.
A Heuristic Approach to Solving Travelling Salesman Problems
Karg, R. L. & Thompson, G. L · 1964
Earlier work this paper cites.
NP-Complete Scheduling Problems
Ullman, J. D · 1975
Earlier work this paper cites.
The NP-Completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
Plesnik, J · 1979
Earlier work this paper cites.
VLSI testing
Williams, T. W · 1986
Earlier work this paper cites.
The land mobile satellite communication channel-recording, statistics, and channel model
Lutz, E., Cygan, D., Dippold, M., Dolainsky, F. & Papke, W · 1991
Earlier work this paper cites.
Storage schemes for parallel memory systems and the N N -Queens Problem
Erbas, C. & Tanik, M. M · 1992
Earlier work this paper cites.
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C. & Beasley, J. E · 1998
Earlier work this paper cites.
The Multiple Subset Sum Problem
Caprara, A., Kellerer, H. & Pferschy, U · 2000
Earlier work this paper cites.
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E. et al · 2001
Earlier work this paper cites.
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment
Jaszkiewicz, A · 2002
Earlier work this paper cites.
The low-density parity-check codes based on The n-queen problem
Li, Peng,Guangxi, Z. & Xiao, L · 2004
Cited alongside, same era.
Scalable generation of multi-atom W states with a single resonant interaction
Zheng, S.-B · 2004
Cited alongside, same era.
Generation of N-qubit W states with rf SQUID qubits by adiabatic passage
Deng, ZJ, Gao, K.L., Feng, M · 2006
Cited alongside, same era.
A survey of known results and research areas for N N -Queens
Bell, J. & Stevens, B · 2009
Cited alongside, same era.
A High-Efficiency LDPC Encoder with Optimized Backtracking Algorithm
Zeng, Z · 2011
Cited alongside, same era.
Solving 8-Queens Problem by Using Genetic Algorithms, Simulated Annealing, and Randomization Method
Al-Khateeb, B. & Tareq, W. Z · 2013
Cited alongside, same era.
Solving N-Queen Problem by Prediction
Lijo, V. et al · 2015
Later among the works it cites.
A quantum annealing approach for Boolean Satisfiability problem
Su, J., Tu, T. & He, L · 2016
Later among the works it cites.
Quantum Annealing and the Satisfiability Problem
Pudenz, K. L., Tallant, G. S., Belote, T. R. & Adachi, S. H · 2016
Later among the works it cites.
Quantum advantage with shallow circuits
Bravyi, S., Gosset, D., & Koenig, R · 2016
Later among the works it cites.
N N -Queens Problem Resolution Using the Quantum Computing Model
de Souza, F. J. & de Mello, F. L · 2017
Later among the works it cites.
A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem
Alharbi, S. & Venkat, I · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Load Balancing using N N -Queens Problem
Panwar, P., Saxena, V. P., Sharma, A. & Sharma, V. K · 2013
Cited alongside, same era.
Performance Analysis of N-Queen Problem using Backtracking and Genetic Algorithm Techniques
Thada, V. & Dhaka, S · 2014
Cited alongside, same era.
On-chip generation of high-order single-photon W-states
Gräfe, M. et al · 2014
Cited alongside, same era.
Comparative study of different algorithms to solve N queens problem
Mukherjee, S., Datta, S., Chanda, P. B. & Pathak, P · 2015
Cited alongside, same era.
Later among the works it cites.
Torggler, V., Aumann, P., Ritsch, H. & Lechner, W · 2018
Closest in time.
Recurrent Neural Networks for Multivariate Time Series with Missing Values
Che, Z., Purushotham, S., Cho, K., Sontag, D. & Liu, Y · 2018
Closest in time.
Exploiting Feature and Class Relationships in Video Categorization with Regularized Deep Neural Networks
Jiang, Y.-G., Wu, Z., Wang, J., Xue, X. & Chang, S.-F · 2018
Closest in time.