Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn theory of computation
·
Module 11
Introduction to Computational Complexity
1
Turing Machine Time Complexity
Define the time complexity of a Turing Machine.
2
Understanding Complexity Class P
Define the complexity class P as the class of languages decidable in polynomial time by a deterministic TM.
3
Defining NP: TMs and Verifiers
Define the complexity class NP using both nondeterministic polynomial-time TMs and polynomial-time verifiers.
P, NP, and the P vs. NP Problem
Explain the relationship between P and NP and the significance of the P vs. NP problem.
5
Understanding NP-Completeness: NP-Hard and NP-Complete
Define the concept of NP-completeness, including the definitions of NP-hard and NP-complete.
6
Turing Machine Space Complexity
Define the space complexity of a Turing Machine.
7
Understanding PSPACE: Definition and Significance
Define the complexity class PSPACE.
End of course,
Back to course
Previous module
Undecidability and Reducibility
Next module