1. G. Ausiello, A. D'Atri and M. Protasi, Lattice theoretic ordering properties for NP-complete optimization problems, Fund. Informat., to appear.
2. Approximation algorithms for combinatorial problems: an annotated bibliography;Garey,1976
3. “Strong” NP-completeness results: motivation, examples and implications;Garey;J. ACM,1978
4. Limiting recursion;Gold;J. Symbolic Logic,1965