Category: Uncategorized

Problem Detail: I’d like to reduce 3 colorability to SAT. I’ve stuffed up somewhere because I’ve shown it’s equivalent to 2 SAT. Given some graph $G = (V,E)$ and three colors, red, blue, green. For every vertex $i$, let the boolean Read More …

Problem Detail: Suppose that there are two problems $P$ and $Q$. How can I say that “solving $P$ is same thing with solving $Q$”? For instance, if $P$ is NP-Hard, then we can say “$P$ can be solved in polynomial time Read More …

Problem Detail: I know that $mathsf{P}^A = mathsf{EXP}$ for any $mathsf{EXPTIME}$-complete language $A$. Is it true that $mathsf{DTIME}^A(n^k) = mathsf{EXP}$ for any fixed $k$ and any $mathsf{EXPTIME}$-complete oracle $A$? If not, what do these complexity classes equal and why? I am Read More …