Bookmarks
Concepts
Activity
Courses
Learning Plans
Courses
Request
Log In
Sign up
New Course
Concept
NP Class
The
NP class
, or
Non-deterministic Polynomial time
, is a
complexity class
used in computational theory to describe
decision problems
for which a solution can be verified in polynomial time by a
deterministic Turing machine
. It is a central concept in computer science, particularly in the study of
algorithmic efficiency
and the famous
P vs NP problem
, which asks whether every problem whose solution can be quickly verified can also be quickly solved.
Relevant Degrees
Computer Science and Data Processing 100%
Generate Assignment Link
Lessons
Concepts
Suggested Topics
Foundational Courses
Learning Plan
Log in to see lessons
Log In
Sign up
3