0 votes 0 votes Do I need to study basic concepts of complexity classes (P, NP , NP-Hard...reduction etc.) ? Prashant Sharma asked Jan 18, 2016 Prashant Sharma 443 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Yes, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete removed from Algorithms but Reduction is there in Theory of Computation. Víkky Mathur answered Jan 20, 2016 Víkky Mathur comment Share Follow See all 3 Comments See all 3 3 Comments reply Arjun commented Jan 20, 2016 reply Follow Share Explicit reduction questions involving NP-Complete won't be asked for GATE (very bad because they were so easy scoring). Also, no need to remember names of NP-Complete problems likes 3-SAT. 1 votes 1 votes Prashant Sharma commented Jan 21, 2016 reply Follow Share @Arjun Sir, What sub-topics do I need to cover to ensure that TM & Undecidability is covered for GATE. 0 votes 0 votes amarVashishth commented Jan 21, 2016 reply Follow Share http://www.techtud.com/computer-science/theory-computation/turing-machines 0 votes 0 votes Please log in or register to add a comment.
