Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following is an NP-complete problem?
1
CNF-Satisfiability problem
2
Turing’s Halting problem
3
Number of Hamiltonian circuits in a complete graph of ‘n’ vertices with n > 2
4
Presburger Arithmetic problem