排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing. Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems. This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs. To expedite the search process, a quantum algorithm employing Grover’s search is proposed. However, a challenge arises from ... 相似文献
1