Syllabus
1. Basic on Complexity Classes
  1.1 Theoretical models of computations and time and space resources
  1.2 Time and space complexity classes
  1.3 The P = NP problem
  1.4 NP and NP-completeness
  1