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...

Descripción completa

Detalles Bibliográficos
Autores principales: Alasow, Abdirahman, Jin, Peter, Perkowski, Marek
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689672/
https://www.ncbi.nlm.nih.gov/pubmed/36359704
http://dx.doi.org/10.3390/e24111615

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689672/
https://www.ncbi.nlm.nih.gov/pubmed/36359704
http://dx.doi.org/10.3390/e24111615

Ejemplares similares