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 />
Ross Willard (Waterloo) <strong>Algebra</strong> <strong>and</strong> <strong>Complexity</strong> Třešť, September 2008 24 / 31