I know that NP problems can't be solved in polynomial time.But what do NP complete and NP hard problems mean?

inspire_all
-4
Newbie Poster

## Recommended Answers

Jump to PostRequired watching for P and NP: https://www.youtube.com/watch?v=msp2y_Y5MLE

Jump to PostI know that NP problems can't be solved in polynomial time.

Since NP is a superset of P that can't possibly be true for all problems in NP. It is likely that NP-hard can't be solved in polynomial time, but that's an open question (NP ?= P), which …

Jump to PostP problems are problems that can be solved by deterministic Turing machine in polynomial time.

NP problems are problems that can be solved by a non-deterministic Turing machine in polynomial time.

Since a non-deterministic Turing machine can always be at least as efficient as a deterministic one, it follows that …

Jump to PostFor NP hard problems is it proved that there no algorithms that can solve this problem in polynomial time?

Not yet, no.

For NP complete problems there have not yet been algorithms that can solve this problems in polynomial time but you cannot completely rule out the …

## All 16 Replies

deceptikon
1,790
Code Sniper
Administrator
Featured Poster

sepp2k
378
Practically a Master Poster

inspire_all
-4
Newbie Poster

sepp2k
378
Practically a Master Poster

inspire_all
-4
Newbie Poster

inspire_all
-4
Newbie Poster

deceptikon
1,790
Code Sniper
Administrator
Featured Poster

sepp2k
378
Practically a Master Poster

inspire_all
-4
Newbie Poster

sepp2k
378
Practically a Master Poster

amina.bm
0
Newbie Poster

mike_2000_17
2,669
21st Century Viking
Team Colleague
Featured Poster

amina.bm
0
Newbie Poster

amina.bm
0
Newbie Poster

mike_2000_17
2,669
21st Century Viking
Team Colleague
Featured Poster

amina.bm
0
Newbie 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, learning, and sharing knowledge.