Self-reducibilitystructuresand solutionsof NP problemst
L. Balcázar · 1989
Using polynornial time self-reducibihiiystructures, we characterize cer- tain helpingnotions,show1mwthe characterizationprovidesthe maintool for the proof of knownrelationshipsbeiweendecisionaland funcilonalNP-completeprob- lems, aud extend this relationships to ihe case of optimization NP-completeproblems.