Can NP hard problems be solved?

1 Answer 1

Photo Credit: Courtesy of 3DStockPhoto (problems image)

Although it is suspected that there are no polynomial-time algorithms for NP-hard problems, this has not been proven. Moreover, the class P, in which all problems can be solved in polynomial time, is contained in the NP class.

Similar Questions

1

Does Gordon Freeman speak?

1

Can you transfer ownership of a Minecraft world?

1

Do you need Internet for uTorrent?

1

What helps your stomach after antibiotics?

1

What is female rat called?

Resources

Stock Photos
Jobs
Developer Jobs Directory
Salary Calculator
Help

Products

Teams
Talent
Advertising
Enterprise

Company

About
Press
Work Here
Legal
Privacy Policy
Contact Us