Show simple item record

dc.contributor.authorMulero Martínez, Juan Ignacio 
dc.date.accessioned2021-11-22T13:28:32Z
dc.date.available2021-11-22T13:28:32Z
dc.date.issued2020-05-13
dc.identifier.citationMulero-Martínez, J. I. (2020). A Polynomial-Time Algorithm for Unconstrained Binary Quadratic Optimization. Preprintes_ES
dc.description.abstractWe develop a polynomial-time algorithm to minimize pseudo-Boolean functions. The computational complexity is O(n □(15/2)), although very conservative, it is su_cient to prove that this minimization problem is in the class P. A direct application of the algorithm is the 3-SAT problem, which is also guaranteed to be in the class P with a computational complexity of order O(n □(45/2)). The algorithm was implemented in MATLAB and checked by generating one million matrices of arbitrary dimension up to 24 with random entries in the range [-50; 50]. All the experiments were successful.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.titleA polynomial-time algorithm for optimization of quadratic pseudo-boolean functionses_ES
dc.typeinfo:eu-repo/semantics/preprintes_ES
dc.subject.otherMatemática Aplicadaes_ES
dc.subjectComputer sciencees_ES
dc.subjectOptimizationes_ES
dc.subjectComputer softwarees_ES
dc.subjectMATLABes_ES
dc.subjectMathematical softwarees_ES
dc.identifier.urihttp://hdl.handle.net/10317/10351
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.type.versioninfo:eu-repo/semantics/submittedVersiones_ES
dc.subject.unesco1102.02 Álgebra de Boolees_ES


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record