Changes

NP-complete is a [[complexity]] class in [[computer science]]. The NP is short for "[[nondeterministic]] [[polynomial]]," and the term is used to refer to a class of problems with the following properties:

'''NP-complete''' is a [[complexity]] class in [[computer science]]. The NP is short for "[[nondeterministic]] [[polynomial]]," and the term is used to refer to a class of problems with the following properties:

* Solutions to NP-complete problems can be verified in polynomial time.

* Solutions to NP-complete problems can be verified in polynomial time.

Because there are many NP-complete problems which have strong implications in [[physics]], [[biology]] and other areas of science, much work in computer science is devoted toward developing algorithms which yield [[approximate]] solutions to these problems.

Because there are many NP-complete problems which have strong implications in [[physics]], [[biology]] and other areas of science, much work in computer science is devoted toward developing algorithms which yield [[approximate]] solutions to these problems.