scientific article
From MaRDI portal
Publication:3663288
zbMath0516.03036MaRDI QIDQ3663288
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityword problemsexponential hierarchyselective setspolynomial time reducibilitiesr.e.- degrees
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items
Diagonalization, uniformity, and fixed-point theorems, A low and a high hierarchy within NP, Minimal pairs for P