Quantum Algorithm for Variant Maximum Satisfiability
In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a PO...
| Main Authors: | , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
MDPI AG
2022-11-01
|
| 丛编: | Entropy |
| 主题: | |
| 在线阅读: | https://www.mdpi.com/1099-4300/24/11/1615 |