scientific article
From MaRDI portal
Publication:3484351
zbMath0704.68041MaRDI QIDQ3484351
Paul G. Spirakis, Maria J. Serna
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On the Average Case Complexity of Some P-complete Problems, Parallel approximation schemes for problems on planar graphs, Approximating the minimum-cost maximum flow is P-complete, Approximating linear programming is log-space complete for P
