126
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

Polynomial-time self-reducibility: theoretical motivations and practical resultsFootnote

, &
Pages 1-9 | Received 30 Sep 1988, Published online: 19 Mar 2007
 

Abstract

Although polynomial-time complexity theory has been formulated in terms of decision problems, polynomial-time decision algorithms generally operate by attempting to construct a solution to an optimization version of the problem at hand. Thus it is that self-reducibility, the process by which a decision algorithm may be used to devise a constructive algorithm, has until now been widely considered a topic of only theoretical interest. Recent fundamental advances in graph theory, however, have made available powerful new nonconstructive tools that can be applied to guarantee membership in P. These tools are nonconstructive at two distinct levels: they neither produce the decision algorithm, establishing only the finiteness of an obstruction set, nor do they reveal whether such a decision algorithm can be of any aid in the construction of a solution. We briefly review and illustrate the use of these tools, and discuss the seemingly formidable task of finding the promised polynomial-time decision algorithms when these new tools apply. Our main focus is on the design of efficient self-reduction strategies, with combinatorial problems drawn from a variety of areas.

Notes

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.