On the structure of \(\Delta_ 2\!^ p\)

DOI10.1016/0020-0190(83)90126-6zbMath0533.03024OpenAlexW2057880543MaRDI QIDQ789386

Uwe Schoening

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90126-6

zbMATH Keywords

NP-completenesspolynomial hierarchycomplexity classesNP vs. co-NP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• On the structure of sets in NP and other complexity classes
• A uniform approach to obtain diagonal sets in complexity classes
• On the Structure of Polynomial Time Reducibility

This page was built for publication: On the structure of \(\Delta_ 2\!^ p\)