Authors:
ANDREEV AE
CLEMENTI A
CRESCENZI P
DAHLHAUS E
DEAGOSTINO S
ROLIM JDP
Citation: Ae. Andreev et al., THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH-DEGREE SUBGRAPH PROBLEM, Theoretical computer science, 205(1-2), 1998, pp. 261-282
Citation: P. Crescenzi et L. Trevisan, ON THE DISTRIBUTED DECISION-MAKING COMPLEXITY OF THE MINIMUM VERTEX COVER PROBLEM, Informatique theorique et applications, 30(5), 1996, pp. 431-441
Citation: P. Crescenzi et Ch. Papadimitriou, REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS, Theoretical computer science, 143(1), 1995, pp. 159-165
Citation: P. Crescenzi et R. Silvestri, A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS, Information processing letters, 47(1), 1993, pp. 11-15