Self-reducibility structures and solutions of NP problems.

José L. Balcázar Navarro

Revista Matemática de la Universidad Complutense de Madrid (1989)

  • Volume: 2, Issue: 2-3, page 175-184
  • ISSN: 1139-1138

Abstract

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

How to cite

top

Balcázar Navarro, José L.. "Self-reducibility structures and solutions of NP problems.." Revista Matemática de la Universidad Complutense de Madrid 2.2-3 (1989): 175-184. <http://eudml.org/doc/43531>.

@article{BalcázarNavarro1989,
abstract = {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.},
author = {Balcázar Navarro, José L.},
journal = {Revista Matemática de la Universidad Complutense de Madrid},
keywords = {Calculabilidad; NP-completitud; computational complexity theory; self-reducibility; NP-complete problems},
language = {eng},
number = {2-3},
pages = {175-184},
title = {Self-reducibility structures and solutions of NP problems.},
url = {http://eudml.org/doc/43531},
volume = {2},
year = {1989},
}

TY - JOUR
AU - Balcázar Navarro, José L.
TI - Self-reducibility structures and solutions of NP problems.
JO - Revista Matemática de la Universidad Complutense de Madrid
PY - 1989
VL - 2
IS - 2-3
SP - 175
EP - 184
AB - 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.
LA - eng
KW - Calculabilidad; NP-completitud; computational complexity theory; self-reducibility; NP-complete problems
UR - http://eudml.org/doc/43531
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.