scientific article; zbMATH DE number 4068281

MaRDI QIDQ3801071zbMATH OpenFDO

Authors J. Hartmanis, Ming Li, Yaacov Yesha

Publication date 1986

zbMATH Keywords

complete setscomplexity classesoraclesparse setsstructure in complexity

Mathematics Subject Classification ID

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

Recommendations

• Sparse sets and collapse of complexity classes
• scientific article; zbMATH DE number 1107624
• scientific article; zbMATH DE number 3926243
• scientific article; zbMATH DE number 549851
• Immunity, simplicity, probabilistic complexity classes and relativizations

Cited in

(6)

• Sparse sets and collapse of complexity classes
• Resource bounded immunity and simplicity
• On complete problems, relativizations and logics for complexity classes
• scientific article; zbMATH DE number 3926243 (Why is no real title available?)
• Nonlevelable sets and immune sets in the accepting density hierarchy inNP
• If not empty, NP-P is topologically large

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 Q3801071)