[Home]NP

HomePage | Recent Changes | Preferences
Difference (from prior major revision) (minor diff, author diff)

Changed: 1c1
In complexity theory, NP is the set of decision problems solvable in polytime on a nondeterministic Turing machine. Or, equivalently, YES answers are checkable in polytime on a deterministic Turing machine. See Complexity classes P and NP and NP-Complete.
In complexity theory, NP is the set of decision problems solvable in polynomial time on a nondeterministic Turing machine. Or, equivalently, YES answers are checkable in polynomial time on a deterministic Turing machine. See Complexity classes P and NP and NP-Complete.
In complexity theory, NP is the set of decision problems solvable in polynomial time on a nondeterministic Turing machine. Or, equivalently, YES answers are checkable in polynomial time on a deterministic Turing machine. See Complexity classes P and NP and NP-Complete.
HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited December 6, 2001 7:24 am by 62.202.117.xxx (diff)
Search: