Question on computaional complexity

Status
Not open for further replies.

pmonon

Full Member level 3
Joined
Jan 28, 2006
Messages
152
Helped
7
Reputation
14
Reaction score
1
Trophy points
1,298
Activity points
2,232
What is NP hard and NP complete? Which one is more difficult or complex? I need an "as simple as possible but no simpler" type explanation please...
 

NP is short for non-polynomial!
 

Status
Not open for further replies.

Similar threads

Cookies are required to use this site. You must accept them to continue using the site. Learn more…