Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 33: | Line 33: | ||
[http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History A good lecture going deep into Abstract Machines] | [http://channel9.msdn.com/Series/C9-Lectures-Yuri-Gurevich-Introduction-to-Algorithms-and-Computational-Complexity/C9-Lectures-Algorithms-with-Yuri-Gurevich-Introduction-and-Some-History A good lecture going deep into Abstract Machines] | ||
− | [[NP,_NP_Complete,_NP_Hard|Identify the class of the language]] | + | [[NP,_NP_Complete,_NP_Hard| P, NP, NPC and NP-Hard in SImple terms]] |
+ | |||
+ | [[Identify_the_class_of_the_language|Identify the class of the language]] | ||
+ | |||
− | |||
[[Category:Automata Theory]] | [[Category:Automata Theory]] | ||
[[Category: Notes & Ebooks for GATE Preparation]] | [[Category: Notes & Ebooks for GATE Preparation]] |
Video Lectures by Shai Simonson
Rice's theorem, Undecidable and unrecognizable problems on TM
Undecidable problems about L(CFG)
Trivial and Non-trivial properties of L(M)
A good lecture going deep into Abstract Machines
P, NP, NPC and NP-Hard in SImple terms
Identify the class of the language
The following 6 pages are in this category, out of 6 total.