scientific article
From MaRDI portal
Publication:3805899
zbMath0657.68045MaRDI QIDQ3805899
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
On the power of parity polynomial time, Robust machines accept easy sets, On the complexity of ranking, A uniform approach to define complexity classes, Kolmogorov characterizations of complexity classes
