Baalla
0
Newbie Poster
Recommended Answers
Jump to PostNP means a NTM can solve it in polynomial time (or equivelantly that a DTM can verify the result in polynomial time). Note that NP is a superset (possibly, but not necessarily, a proper superset) of P, meaning that everything in P is also in NP.
A problem X being …
All 4 Replies
sepp2k
378
Practically a Master Poster
Schol-R-LEA
1,446
Commie Mutant Traitor
Featured Poster
sepp2k
378
Practically a Master Poster
Schol-R-LEA
1,446
Commie Mutant Traitor
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.