NP Learning icon

NP Learning

Android Education
Offers in-app purchases ($0.00)
You're viewing an Android app.

Quick Stats

3 years

since last update

2 years

since last review


NP-hard (Non-deterministic Polynomial-time hard), in computational complexity theory, is a class of problems that are, "at least as hard as the hardest problems in NP". And any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution in the first place; indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known. This App will give the idea about NP Complete and NP hard.

Also here you can test your skills and knowledge about NP .