Self-reducibility structures and solutions of NP problems.
Balcázar Navarro, José L.
Revista Matemática de la Universidad Complutense de Madrid, Tome 2 (1989), p. 175-184 / Harvested from Biblioteca Digital de Matemáticas
Access to full text

Using 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.

Publié le : 1989-01-01
DMLE-ID : 605 
@article{urn:eudml:doc:43531,
     title = {Self-reducibility structures and solutions of NP problems.},
     journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
     volume = {2},
     year = {1989},
     pages = {175-184},
     zbl = {0687.68018},
     mrnumber = {MR1031693},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:43531}
}

Balcázar Navarro, José L. Self-reducibility structures and solutions of NP problems.. Revista Matemática de la Universidad Complutense de Madrid, Tome 2 (1989) pp. 175-184. http://gdmltest.u-ga.fr/item/urn:eudml:doc:43531/