1. N. Alon and J.H. Spencer (1992), The Probabilistic Method, Wiley-Interscience Publication.
2. R. Anderson, and E.W. Mayr (1984), “A P-complete problem and approximation to it”, Technical Report STAN-CS-84-1014, Department of Computer Science, Stanford University.
3. R. Anderson, and E.W. Mayr (1987), “Parallelism and greedy algorithms”, in Advances in Computing Research: Parallel and Distributed Computing, F.P. Preparata (ed.), JAI Press, 17–38.
4. B. Bollobas (1985), Random Graphs, Academic Press.
5. G. Bongiovanni, P. Crescenzi, S. De Agostino (1995), “MAX SAT and MIN SET COVER Approximation Algorithms are P-Complete”, Parallel Processing Letters, to appear.