Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
Universal Algebra and Computational Complexity Lecture 3
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Obviously INEQUIV -TERM is in NP. (Any solution ⃗x to s(⃗x) ≠ t(⃗x)<br />
serves as a certificate.)<br />
On the other h<strong>and</strong>, <strong>and</strong> equally obviously, SAT ≤ P INEQUIV -TERM.<br />
(Map ϕ ↦→ (2 BA , ϕ, 0).)<br />
Hence INEQUIV -TERM is obviously NP-complete.<br />
EQUIV -TERM, being its negation, is said to be co-NP-complete.<br />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 24 / 31
Change language