Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2021-09-21T13:55:11Z
dc.date.available 2021-09-21T13:55:11Z
dc.date.issued 2011
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/125243
dc.description.abstract This work presents a quantum search algorithm to solve the 3-SAT problem. An improvement over one of the best known classical algorithms for this problem is proposed, replacing the local search with a quantum search algorithm. The performance of the improved algorithm is assessed by simulating it using parallel programming techniques with shared memory. The experimental analysis demonstrate that the parallel simulation of the algorithm takes advantage of the available computing resources to improve over the eficiency of the sequential version, thus allowing to perform realistic simulations in reduced execution times. en
dc.format.extent 84-95 es
dc.language es es
dc.subject 3-SAT es
dc.subject algorithm es
dc.title A parallel spatial quantum search algorithm applied to the 3-SAT problem en
dc.type Objeto de conferencia es
sedici.identifier.issn 1850-2784 es
sedici.creator.person Hernández Barreto, Miguel A. es
sedici.creator.person Abal, G. es
sedici.creator.person Nesmachnow, Sergio es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.date.exposure 2011-08
sedici.relation.event XII Argentine Symposium on Artificial Intelligence (ASAI 2011) (XL JAIIO, Córdoba, 29 y 30 de agosto de 2011) es
sedici.description.peerReview peer-review es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (826.1Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)