1. and Testing satisfiability, Proc 13th Annu ACM-SIAM Symp Discrete Algorithms, San Francisco, 6-8 January 2002, pp 645-654.
2. Lecture Notes;Andersson,1998
3. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
4. Proof verification and the hardness of approximation problems
5. The complexity of theorem-proving procedures, Conf Record Third Annu ACM Symp Theory of Computing, Shaker Heights, OH, 3-5 May 1971, pp. 151-158.