TY  - JOUR
AU  - Paulet, José J.
AU  - Llana Díaz, Luis Fernando
AU  - Calvo, Hernán Indíbil
AU  - Mezzini, Mauro
AU  - Cuartero, Fernando
AU  - Pelayo, Fernando L.
PY  - 2023
DO  - 10.3390/math11081888
UR  - https://hdl.handle.net/20.500.14352/112876
T2  - Mathematics
AB  - The SAT problem is maybe one of the most famous NP-complete problems. This paper deals with the 3-SAT problem. We follow a sort of incremental strategy to save computational costs with respect to the classical quantum computing approach. We present an...
LA  - eng
PB  - MDPI
KW  - Computational efficiency
KW  - DPLL algorithm
KW  - Grover algorithm
KW  - SAT problem
TI  - Heuristics for Quantum Computing Dealing with 3-SAT
TY  - journal article
VL  - 11
ER  -