Skip to main content
Book Chapter

The Class NP and NP-Complete Problems

  • Blum L
  • Cucker F
  • Shub M
  • et al.
Springer New York, (1998), 99-112
DOI: 10.1007/978-1-4612-0701-6_5
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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...

Cite

CITATION STYLE

APA

Blum, L., Cucker, F., Shub, M., & Smale, S. (1998). The Class NP and NP-Complete Problems. In Complexity and Real Computation (pp. 99–112). Springer New York. https://doi.org/10.1007/978-1-4612-0701-6_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free