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 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 …
Jump to PostNon deterministic methods: present many choice and one must choose the suitable one among others(e.g. Genetic algorithms), in such case we talk about a pseudo-algorithm.
We generally call that a probabilistic method, or probabilistic algorithms. This is quite different from the concepts of deterministic / non-deterministic Turing machines. …
Jump to PostOtherwise, it would be appreciated if you ever clarify what you mean by "Deterministic", maybe I didn't figure you out.
A good place to start is probably the first sentence on the wiki page:
"A deterministic algorithm is an algorithm which, given a particular input, will always produce …
All 16 Replies
deceptikon 1,790 Code Sniper Team Colleague 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 Team Colleague 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, networking, learning, and sharing knowledge.