Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

Heuristics for Quantum Computing Dealing with 3-SAT

Simple item page
dc.contributor.authorPaulet, José J.
dc.contributor.authorLlana Díaz, Luis Fernando
dc.contributor.authorCalvo, Hernán Indíbil
dc.contributor.authorMezzini, Mauro
dc.contributor.authorCuartero, Fernando
dc.contributor.authorPelayo, Fernando L.
dc.date.accessioned2024-12-18T10:04:41Z
dc.date.available2024-12-18T10:04:41Z
dc.date.issued2023-04-16
dc.description.abstractThe 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.
dc.description.departmentDepto. de Sistemas Informáticos y Computación
dc.description.facultyFac. de Estudios Estadísticos
dc.description.refereedTRUE
dc.description.sponsorshipMinisterio de Economía y Competitividad (España)
dc.description.sponsorshipComunidad de Madrid
dc.description.sponsorshipUnión Europea
dc.description.statuspub
dc.identifier.citationPaulet, 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
dc.identifier.doi10.3390/math11081888
dc.identifier.officialurlhttps://doi.org/10.3390/math11081888
dc.identifier.relatedurlhttps://www.mdpi.com/2227-7390/11/8/1888
dc.identifier.urihttps://hdl.handle.net/20.500.14352/112876
dc.issue.number8
dc.journal.titleMathematics
dc.language.isoeng
dc.publisherMDPI
dc.relation.projectIDPID2021-122215NB-C31
dc.relation.projectIDS2018/TCS-4314
dc.relation.projectID220426UCTR
dc.rightsAttribution-NonCommercial 4.0 Internationalen
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/
dc.subject.cdu004
dc.subject.keywordComputational efficiency
dc.subject.keywordDPLL algorithm
dc.subject.keywordGrover algorithm
dc.subject.keywordSAT problem
dc.subject.ucmInformática (Informática)
dc.subject.unesco1203.17 Informática
dc.titleHeuristics for Quantum Computing Dealing with 3-SAT
dc.typejournal article
dc.type.hasVersionVoR
dc.volume.number11
dspace.entity.typePublication
relation.isAuthorOfPublication680f556a-4f1b-4eda-9add-da2c9b24796a
relation.isAuthorOfPublication.latestForDiscovery680f556a-4f1b-4eda-9add-da2c9b24796a

Download

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Heuristics
Size:
1.04 MB
Format:
Adobe Portable Document Format
downoload Download

Collections

Artículos