Quantum cooperative search algorithm for 3-sat
From MaRDI portal
Publication:859988
DOI10.1016/J.JCSS.2006.09.003zbMATH Open1178.68182OpenAlexW1994758055MaRDI QIDQ859988FDOQ859988
Authors: 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
Recommendations
evolutionary algorithmGrover's search algorithm3-sat problemsheuristic local search algorithmNP complexity
Cites Work
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Title not available (Why is that?)
- Quantum switching and quantum merge sorting
- Heuristic methods for evolutionary computation techniques
Cited In (6)
- Experimental realization of a highly structured search algorithm
- APPLYING QUANTUM SEARCH TO AUTOMATED TEST PATTERN GENERATION FOR VLSI CIRCUITS
- A quantum cooperative immune algorithm for SAT problems
- Three ``quantum algorithms to solve 3-SAT
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
This page was built for publication: Quantum cooperative search algorithm for 3-sat
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859988)
