scientific article
From MaRDI portal
Publication:3770515
zbMath0633.03035MaRDI QIDQ3770515
Publication date: 1986
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
Collapsing degrees via strong computation ⋮ Completeness for nondeterministic complexity classes ⋮ The structure of generalized complexity cores ⋮ E-complete sets do not have optimal polynomial time approximations ⋮ On optimal polynomial time approximations: P-levelability vs. δ-levelability ⋮ On inefficient special cases of NP-complete problems ⋮ Resource bounded immunity and simplicity
