Quantum cooperative search algorithm for 3-sat
From MaRDI portal
Publication:859988
DOI10.1016/j.jcss.2006.09.003zbMath1178.68182OpenAlexW1994758055MaRDI QIDQ859988
Sheng-Tzong Cheng, Ming-Hung Tao
Publication date: 22 January 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.09.003
evolutionary algorithmGrover's search algorithm3-sat problemsheuristic local search algorithmNP complexity
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Heuristic methods for evolutionary computation techniques
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum switching and quantum merge sorting
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
This page was built for publication: Quantum cooperative search algorithm for 3-sat