RT Journal Article
T1 Heuristics for Quantum Computing Dealing with 3-SAT
A1 Paulet, José J.
A1 Llana Díaz, Luis Fernando
A1 Calvo, Hernán Indíbil
A1 Mezzini, Mauro
A1 Cuartero, Fernando
A1 Pelayo, Fernando L.
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 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.
PB MDPI
YR 2023
FD 2023-04-16
LK https://hdl.handle.net/20.500.14352/112876
UL https://hdl.handle.net/20.500.14352/112876
LA eng
NO Paulet, 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/math11081888
NO Ministerio de Economía y Competitividad (España)
NO Comunidad de Madrid
NO Unión Europea
DS Docta Complutense
RD 11 abr 2025