scientific article
From MaRDI portal
Publication:3801071
zbMath0654.68051MaRDI QIDQ3801071
Ming Li, Yaacov Yesha, Juris Hartmanis
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 (3)
If not empty, NP-P is topologically large ⋮ On Complete Problems, Relativizations and Logics for Complexity Classes ⋮ Resource bounded immunity and simplicity
This page was built for publication: