engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms

Which statement is true for NP-hard problems?

1
They are the hardest problems in the class NP.
2
They can be solved in polynomial time.
3
They are easier than P problems.
4
They can be solved using dynamic programming.
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters