scientific article
From MaRDI portal
Publication:3760533
zbMath0623.03043MaRDI QIDQ3760533
Selman, Alan L., John G. Geske, Dung T. Huynh
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenesscomplexity classeshierarchy theoremdeterministic time hierarchyalmost everywhere complex setspolynomial complexity degrees
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (9)
A complexity theory for feasible closure properties ⋮ OnP-subset structures ⋮ Bi-immunity results for cheatable sets ⋮ The complexity types of computable sets ⋮ Almost-everywhere complexity hierarchies for nondeterministic time ⋮ A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes ⋮ Some consequences of the existnce of pseudorandom generators ⋮ Weak completeness notions for exponential time ⋮ Almost-everywhere superiority for quantum polynomial time
This page was built for publication:
