Author:
Andreev A.E.,Clementi A.,Crescenzi P.,Dahlhaus E.,De Agostino S.,Rolim J.D.P.
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. The Probabilistic Method;Alon,1992
2. A P-complete problem and approximation to it;Anderson,1984
3. Parallelism and greedy algorithms;Anderson,1987
4. Random Graphs;Bollobas,1985
5. G. Bongiovanni, P. Crescenzi, S. De Agostino, MAX SAT and MIN SET COVER approximation algorithms are P-complete, Parallel Process. Lett. to appear.