Thinkycap logo
Worksheets

Computational Complexity

Bachelor of Engineering (BEng) · University · Computer Science

Computational Complexity explores the inherent difficulty of computational problems, introducing the classes P, NP, and NP-completeness. This unit provides a foundation for understanding the limitations and capabilities of algorithms.

Coming soonPractice questions for this topic are coming soonUntil then, you can already practice other topics.Browse topics

What's included

  • Introduction to Computational Complexity
  • Complexity Classes: P
  • NP
  • and NP-Completeness
  • Reductions and NP-Completeness
  • Time and Space Complexity Analysis
  • The P vs NP Problem

Keywords

  • Complexity Classes
  • P vs NP Problem
  • NP-Completeness
  • Algorithm Analysis
  • Computational Complexity
  • Reductions
  • Time Complexity
  • Space Complexity