Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Self-reducibility structures and solutions of NP problems.

José L. Balcázar Navarro — 1989

Revista Matemática de la Universidad Complutense de Madrid

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.

Page 1

Download Results (CSV)