Abstract
Several different additions to the basic deterministic Turing-machine model are often considered. These additions add computational power to the model and so allow us to compute certain problems more efficiently. Often these are important problems with seemingly no efficient solution in the basic model. The question then becomes whether the efficiency the additional power provides is really due to the new model or whether the added efficiency could have been attained without the additional resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Homer, S., Selman, A.L. (2001). Nondeterminism and NP-Completeness. In: Computability and Complexity Theory. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3544-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3544-4_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2865-8
Online ISBN: 978-1-4757-3544-4
eBook Packages: Springer Book Archive