scientific article; zbMATH DE number 3988707

zbMATH Open0611.68019MaRDI QIDQ3751005FDOQ3751005

Authors: Leen Torenvliet, Peter van Emde Boas 

Publication date: 1986

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

Recommendations

• Publication:4734760
• scientific article; zbMATH DE number 1860655
• Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets
• Diagonalizations over polynomial time computable sets
• Publication:4503828

zbMATH Keywords

complexity classesovervieworacle setsP-Time Hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A time-space hierarchy between polynomial time and polynomial space
• Simplicity, immunity, relativizations and nondeterminism
• A uniform approach to define complexity classes
• A note on separating the relativized polynomial time hierarchy by immune sets
• On the cutting edge of relativization: The resource bounded injury method
• Title not available (Why is that?)
• Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets
• Title not available (Why is that?)
• Strong self-reducibility precludes strong immunity

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