Week 20:
We will consider the class MAX-SNP and show that MAX-kSAT does not have a polynomial time approximation scheme, assuming that P is not NP. (We assume that NP=PCP(log n, 1) without proving it.) See chapter 10 of Hochbaum's book on Approximation Algorithms. We will also begin on DNA computation. For this, see the February 1999 Bulletin of the EATCS - Martyn Amos' article.
Last modified: May 17, 1999.
Joan F. Boyar
(joan@imada.sdu.dk)