NP Hard and NP Complete Problems Concept Discussion
NP-hard or Non Deterministic Polynomial Time Hard problem is a situation where an algorithm that solves it can be converted to one for solving other NP-Problems.
It's also written that a problem is NP-hard if and only if there is an NP-complete problem.
Please explain this concept (with suitable example if possible). 😐
It's also written that a problem is NP-hard if and only if there is an NP-complete problem.
Please explain this concept (with suitable example if possible). 😐
Replies
You are reading an archived discussion.
Related Posts
CrazyEngineers Free Mock Aptitude Test - 5 On 21st August (Sunday) at 10:00 am
NOTICE: You must be CrazyEngineers Forum Member to participate in test. Those who do not have...
A B+ tree or "B plus tree" is a data structure used as an index to facilitate fast access of different entries in a database.
Each object/node is associated with...
If you get some news about job openings for instrumentation engineers in your city, please post it here.
It will be useful for many engineers around.
Techastra ’11 is a platform for all students from various disciplines of engineering and management pan India, which provides an opportunity to present share and improve the knowledge. It’s a...
POINTERS-2K11 is a National Level Technical Symposium, conducted by the Computer Science and Engineering Department of Arunai Engineering College, TamilNadu. The Symposium is going to be conducted on 8-9 September,...