1. Home >
  2. Apps >
  3. Groups >

NP - Complete Problems in Automata Theory Explained - Video Lecture

Question asked by Sahithi Pallavi in #Coffee Room on Jan 2, 2012
Sahithi Pallavi
Sahithi Pallavi · Jan 2, 2012
Rank A2 - PRO
Concept of NP - Complete Problems in the Theory of Automata, Formal Languages and Computation were neatly explained by Prof.Kamala Krithivasan, Department of Computer Science and Engineering, IIT Madras. Feel free to share your ideas and ask your doubts here....


Posted in: #Coffee Room

You must log-in or sign-up to reply to this post.

Click to Log-In or Sign-Up