Software Engineering KB

Home

❯

01 Foundations

❯

02 Computational Complexity

❯

00 Category

❯

Complexity Classes

Complexity Classes

Feb 10, 20261 min read

  • computational-complexity
  • complexity-classes

Complexity Classes

Back: Computational Complexity

Groupings of computational problems based on the resources required to solve them. Complexity classes define the landscape of computational tractability and establish which problems can be efficiently solved by different models of computation.

Concepts

  • P
  • NP
  • NP-Complete
  • NP-Hard
  • P vs NP Problem
  • PSPACE, EXPTIME
  • Undecidable Problems

computational-complexity complexity-classes


Graph View

  • Complexity Classes
  • Concepts

Backlinks

  • NP-Complete
  • NP-Hard
  • NP
  • P vs NP Problem
  • P
  • PSPACE, EXPTIME
  • Undecidable Problems
  • Computational Complexity

Created with Quartz v4.5.2 © 2026

  • GitHub