1. Proof verification and intractability of approximation problems;Arora;Journal of the Association for Computing Machinery,1998
2. Complexity and approximation. Combinatorial optimization problems and their approximability properties;Ausiello,1999
3. Structure preserving reductions among convex optimization problems;Ausiello;Journal of Computing and System Sciences,1980
4. Algorithms and heuristics for max-sat;Battiti,1998
5. P. Crescenzi, V. Kann. A compendium of NP optimization problems. Available on www_address: http://www.nada.kth.se/viggo/problemlist/compendium.html