Question: 1 8 . What does NP - hard refer to in computational complexity? a ) Hardness of problems b ) Easy solutions c )

18. What does "NP-hard" refer to in computational complexity?
a) Hardness of problems
b) Easy solutions
c) Polynomial time
d) Heuristic solutions

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!