+A **complexity class** groups computational problems based on the resources—typically [Time](/wiki/Time) or [Space](/wiki/Space)—needed by an algorithm to solve them. These classes map the inherent difficulty of problems, revealing the boundaries of efficient computation.
+## See also
+- [P vs NP](/wiki/P_vs_NP)
+- [Algorithm](/wiki/Algorithm)
+- [Computational Problem](/wiki/Computational_Problem)
... 1 more lines