Abstract
Although it may not be at all obvious given a polynomial over R how to decide whether it has a zero over R, it is a straightforward procedure to verify a solution that may be presented to us. Just plug the purported solution into the polynomial and evaluate it. Is this verification tractable in our model of computation? An affirmative answer will depend on the underlying mathematical properties of the ring or field, as well as our measure of complexity, and is at the core of the notion of NP.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blum, L., Cucker, F., Shub, M., Smale, S. (1998). The Class NP and NP-Complete Problems. In: Complexity and Real Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0701-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0701-6_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6873-4
Online ISBN: 978-1-4612-0701-6
eBook Packages: Springer Book Archive