scientific article; zbMATH DE number 3815631

zbMATH Open0516.03036MaRDI QIDQ3663288FDOQ3663288

Authors: Uwe Schöning 

Publication date: 1981

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityword problemsexponential hierarchyselective setspolynomial time reducibilitiesr.e.- degrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (3)

• Diagonalization, uniformity, and fixed-point theorems
• A low and a high hierarchy within NP
• Minimal pairs for P

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663288)