Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Easy Questions

Theory of Computation

Theory of computation miscellaneous
  1. The problems 3-SAT and 2-SAT are
    1. both in P
    2. both NP-complete
    3. NP-complete and in P respectively
    4. undecidable and NP-complete respectively
Correct Option: C

3 SAT → NP-complete problem 2 SAT → P type problem


Your comments will be displayed only after manual approval.