Abstract
Before we give a formal definition of reduction, let us clarify the notion of a decision problem. Informally, a decision problem is a yes-or-no question. A decision problem is given by a description of the problem domain, i.e. the set of all possible instances of the problem, along with a description of the set of “yes” instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kozen, D.C. (1992). More on Reductions and NP-Completeness. In: The Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4400-4_22
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4400-4_22
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8757-5
Online ISBN: 978-1-4612-4400-4
eBook Packages: Springer Book Archive