Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability

The problems 3-SAT and 2-SAT are

1

Both NP-complete

2

Both in P

3

NP-complete and in P, respectively

4

Undecidable and NP-complete, respectively

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters