scientific article; zbMATH DE number 3926244

zbMATH Open0578.68038MaRDI QIDQ3700835FDOQ3700835

Authors: Gerhard Lischke 

Publication date: 1986

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

Recommendations

• On relativized exponential and probabilistic complexity classes
• Relativizations comparing NP and exponential time
• scientific article; zbMATH DE number 4011940
• Oracles for Deterministic Versus Alternating Classes
• Towards the Actual Relationship Between NP and Exponential Time

zbMATH Keywords

polynomial timeexponential timecomputational complexity classesrecursive oraclesquery machines

Mathematics Subject Classification ID

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

Cited In (4)

• Two oracles that force a big crunch
• Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP
• On relativized exponential and probabilistic complexity classes
• On Relativized Polynomial and Exponential Computations

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