Paulet, José J.Llana Díaz, Luis FernandoCalvo, Hernán IndíbilMezzini, MauroCuartero, FernandoPelayo, Fernando L.2024-12-182024-12-182023-04-16Paulet, J.J.; LLana, L.F.; Calvo, H.I.; Mezzini, M.; Cuartero, F.; Pelayo, F.L. Heuristics for Quantum Computing Dealing with 3-SAT. Mathematics 2023, 11, 1888. https:// doi.org/10.3390/math1108188810.3390/math11081888https://hdl.handle.net/20.500.14352/112876The 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 heuristics that leads this strategy, improving the performance of the purely random incremental scheme. We finally validate our approach by means of a thorough empirical study.engAttribution-NonCommercial 4.0 Internationalhttp://creativecommons.org/licenses/by-nc/4.0/journal articlehttps://doi.org/10.3390/math11081888https://www.mdpi.com/2227-7390/11/8/1888open access004Computational efficiencyDPLL algorithmGrover algorithmSAT problemInformática (Informática)1203.17 Informática