Complexity Classes

In computer science, there exist some problems whose solutions are not yet found, the problems are divided into classes known as Complexity Classes. In complexity theory, a Complexity Class is a set of problems with related complexity. These classes help scientists to groups problems based on how much time and space they require to solve problems and verify the solutions. It is the branch of the theory of computation that deals with the resources required to solve a problem.

Visit the following resources to learn more:

• Types of Complexity Classes | P, NP, CoNP, NP hard and NP complete
• Trying to understand P vs NP vs NP Complete vs NP Hard
• Complexity: P, NP, NP-completeness, Reductions
• Complexity: Approximation Algorithms
• Complexity: Fixed-Parameter Algorithms
• Lecture 23: Computational Complexity
• Greedy Algs. II & Intro to NP Completeness
• NP Completeness II & Reductions
• NP Completeness III
• NP Completeness IV
• CSE373 2020 - Lecture 23 - NP-Completeness
• CSE373 2020 - Lecture 24 - Satisfiability
• CSE373 2020 - Lecture 25 - More NP-Completeness
• CSE373 2020 - Lecture 26 - NP-Completeness Challenge