Revisiting the hardness of approximation of Maximum 3-Satisfiability
This work contains a proof that Maximum 3-Satisfiability is complete for the class APX under AP reductions, as well as a proof that it is hard to approximate.
This file was last updated on 25 October 2012.
This paper can be found at https://github.com/jfinkels/apxcompleteness.
To download the paper using Git, run
git clone git://github.com/jfinkels/apxcompleteness
A somewhat recent version of this work should be available at https://github.com/jfinkels/apxcompleteness/downloads, but I can't guarantee that that will always be up to date, since I compile and upload it manually.
pdflatex, compile-time dependencies include the following LaTeX
On Ubuntu 11.04, 11.10, 12.04, or 12.10, the necessary system packages which contain these LaTeX packages are:
To install them, run
sudo apt-get install texlive-base texlive-latex-base texlive-latex-extra \ texlive-science
To compile the document, run
pdflatex apxcompleteness bibtex apxcompleteness pdflatex apxcompleteness pdflatex apxcompleteness
The output is
apxcompleteness.pdf, and can be viewed with any PDF reader.
Copyright 2012 Jeffrey Finkelstein.
Except where otherwise noted, both the LaTeX markup and the content of both the article and the poster are made available under the terms of the Creative Commons Attribution-ShareAlike 3.0 license, https://creativecommons.org/licenses/by-sa/3.0/.
Jeffrey Finkelstein firstname.lastname@example.org