COL705 Theory of Computation and Complexity
3 credits (3-0-0) Pre-requisites: COL352 OR Equivalent Review of Automata Theory, Turing Machines and Universal Turing Machines. Computability & Undecidability, Rice’s theorem. Computational Complexity: Time… Read More »COL705 Theory of Computation and Complexity