NP complexity class/Definition: Difference between revisions
Jump to navigation
Jump to search
imported>Meg Taylor (add) |
imported>Peter Schmitt (rewritten, the class is not a problem!) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
<noinclude>{{Subpages}}</noinclude> | <noinclude>{{Subpages}}</noinclude> | ||
Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. | |||
Latest revision as of 09:22, 13 August 2010
Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.