Quantum cooperative search algorithm for 3-SAT

Journal of Computer and System Sciences - Tập 73 - Trang 123-136 - 2007
Sheng-Tzong Cheng1, Ming-Hung Tao1
1Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC

Tài liệu tham khảo

Gent, 1993, Toward an understanding of hill-climbing procedures for SAT, 28 Gent, 1995, Unsatisfied variables in local search, 73 Frank, 1996, Weighting for godot: Learning heuristics for GSAT, 338 de Jong, 1989, Using genetic algorithms to solve NP-complete problems, 124 Bäck, 1998, A superior evolutionary algorithm for 3-SAT, 125 Benioff, 1980, The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by Turing machines, J. Stat. Phys., 22, 563, 10.1007/BF01011339 Feynman, 1982, Simulating physics with computers, Int. J. Theor. Phys., 21, 467, 10.1007/BF02650179 Deutsch, 1985, Quantum theory, the Church–Turing principle and the universal quantum computer, vol. 400, 97 Bennett, 1984, Quantum cryptography: Public key distribution and coin tossing, 175 Shor, 1994, Algorithms for quantum computation: Discrete logarithms and factoring, 124 Cheng, 2005, Quantum communication for wireless WAN networks, IEEE Journal of Selected Areas in Communication, 23, 1424, 10.1109/JSAC.2005.851157 Cheng, 2006, Quantum switching and quantum merge sorting, IEEE Trans. Circuits Syst., 53, 316, 10.1109/TCSI.2005.856669 Grover, 1996, A fast quantum mechanical algorithm for database search, 212 Cook, 1971, The complexity of theorem proving procedures, 151 Zvonkin, 1970, The complexity of finite objects and the algorithmic concepts of information and randomness, Russian Math. Surveys, 25, 83, 10.1070/RM1970v025n06ABEH001269 Perdrix, 2004, Measurement-based quantum Turing machines and their universality, Quantum Physics Boyer, 1998, Tight bounds on quantum searching, Fortschr. Phys., 46, 493, 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P Greenwood, 2001, Finding solutions to NP problems: Philosophical differences between quantum and evolutionary search algorithms, 815 Michalewicz, 1995, Heuristic methods for evolutionary computation techniques, J. Heuristics, 1, 177, 10.1007/BF00127077 Mitchell, 1992, Hard and easy distributions of SAT problems, 459