1,128
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: − +
fmt
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.