Computational and Complexity Theory

Computational Complexity
New
Rating: 5.0 out of 5 (1 rating)
614 students
1hr 20min of on-demand video
English
English [Auto]

Understand the basics of Computational Theory
Apply the knowledge of Computational complexity on different problems
Understand the basics of Complexity Theory
Apply the acquired knowledge of Complexity classes on Real Time Applications

Requirements

  • Basics of Automata Theory

Description

This course gives a basic idea about various languages such as decidable, undecidable, recursive, and recursively enumerable languages. Decidable language and its examples are explained. The differences between the languages are mentioned. It discusses problems and theorems based on the languages specified. A famous theorem called the Rice theorem is discussed along with its main property called Non-Trivial Property. A non-trivial property is a very important one in order to state the rice theorem. In the explanation of the Rice theorem, two theorems are discussed and explained in a detailed manner. Few quizzes and question and answer sections are given to improve the knowledge on the same. A problem called Post correspondence problem which is undecidable that is explained in a detailed way. The modified version of the Post correspondence problem is called MPCP which is also discussed in this course. The conversion of MPCP to PCP is explained. The step-by-step conversion with an example is explained in the lecture. How the Post Correspondence Problem is called Undecidable is also discussed. The closure properties and their relations are discussed. At last, classes under complexity theory such as P, NP, NP-Hard, and NP-Complete are clearly explained. The differences between the classes are elaborated in an understandable way.

Who this course is for:

  • Learners who are curious to know about computational problems and complexity classes

Instructor

Associate professor
Gayathri VM
  • 4.8 Instructor Rating
  • 3 Reviews
  • 751 Students
  • 2 Courses

Dr.V.M.Gayathri is currently working as an Assistant Professor in SRM Institute of science and technology in the department of Networking and Communications from June 2017. She Completed her Ph.D., in Saveetha Institute of Medical and Technical Sciences in the year 2019 on Ad-hoc Network security. She received her Master’s Degree in the field of Computer Science and Engineering from B.S.Abdur Rahman Crescent University. She earned her Bachelor’s Degree in the field of Computer Science from Anna University. She got placed in on-campus drive of Cognizant Technical Solutions (CTS) during the end of third year of her UG studies. After completing her UG, she worked as a lecturer in SBC Engineering College for 6 months till Cognizant Technical Solutions called out for employment. That experience gave her the right route to serve the society in the way of teaching. It showed her the path and gave self-realization about her career. Then, she worked in CTS as Program Analyst Trainee for 8 months. As teaching is her passion, she has started her career as an Assistant Professor in Saveetha School of Engineering around 4 years. In total, she has 9 years of Teaching Experience. Her Areas of Interests are Wireless Communication, Network Security, Deep Learning and Artificial Intelligence.

Top companies trust Udemy

Get your team access to Udemy's top 17,000+ courses