1. D. Achlioptas, L. M. Kirousis, E. Kranakis, and D. Krinzac, Rigorous results for random (2+p)-SAT, Proc. Work. on Randomized Algorithms in Sequential, Parallel and Distributed Computing, Santorini, Greece, 1997.
2. P. Alimonti, New local search approximation techniques for maximum generalized satisfiability problems, Proc. Second Italian Conf. on Algorithms and Complexity, Rome, 1994, pp. 40–53.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society, 1992, pp. 14–23.
4. S. Arora and S. Safra Probabilistic checking of proofs: a new characterization of NPProc. 33rd Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society, 1992, pp. 2–13.
5. T. Asano Approximation algorithms for MAX-SAT: Yannakakis vs. G oemans- WilliamsonProc. 3rd Israel Symp. on the Theory of Computing and Systems, Ramat Gan, Israel, 1997, pp. 24–37.