Self-reducibility structures and solutions of NP problemst

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.