P, NP, NP-Complete, NP-Hard July 9, 2016 by arjun Leave a Comment It might be because of the name but many graduate students find it difficult to understand $\textsf{NP}$ problems. So, I thought of explaining them in an easy way. (When explanation […] Share this:TwitterWhatsAppFacebookLike this:Like Loading...
Some Reduction Inferences April 19, 2016 by ibia Leave a Comment How to solve problems by reduction? Share this:TwitterWhatsAppFacebookLike this:Like Loading...
Grammar: Decidable and Undecidable Problems December 7, 2015 by Arjun Suresh 9 Comments Decidable and undecidable problems on context free grammars. Share this:TwitterWhatsAppFacebookLike this:Like Loading...
Closure Property of Language Families December 7, 2015 by Arjun Suresh 9 Comments Closure Properties of language families Share this:TwitterWhatsAppFacebookLike this:Like Loading...
Discussion on Decidability October 25, 2015 by Arjun Suresh Leave a Comment GATE CSE discussion on decidability portion of theory of Computation Share this:TwitterWhatsAppFacebookLike this:Like Loading...
You must be logged in to post a comment.