Random Instance Generation for MAX 3SAT

New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

SIAM Journal on Discrete Mathematics

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)

Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Hard Instance Generation for SAT (Extended Abstract)

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation

Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence

A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science