Ask
Login
0
1.5kviews
Non- Deterministic Polynomial Algorithms
written 6.7 years ago by gravatar for teamques10 teamques10 ★ 70k
analysis of algorithms
ADD COMMENT EDIT
1 Answer
1
25views
written 6.7 years ago by gravatar for teamques10 teamques10 ★ 70k

A problem is in the class NPC if it is in NP and is as hard as any problem in NP. A problem is NP-hard if all problems in NP are polynomial time reducible to it, even though it may not be in NP itself.

enter image description here

If a polynomial time algorithm …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.