Show simple item record

dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-05-27T17:06:50Z
dc.date.available2020-05-27T17:06:50Z
dc.date.issued1988
dc.identifier.citationBalcazar, J. L. "Self-reducibility structures and solutions of NP problems". 1988.
dc.identifier.urihttp://hdl.handle.net/2117/189295
dc.description.abstractUsing polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional NP-complete problems, and extend this relationships to the case of optimization NP-complete problems.
dc.format.extent9 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-88-19
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshReduce
dc.subject.otherAuto-reduibilitat
dc.titleSelf-reducibility structures and solutions of NP problems
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.rights.accessOpen Access
local.identifier.drac28516049
dc.description.versionPostprint (published version)
local.citation.authorBalcazar, J. L.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain