Publication:4370034
From MaRDI portal
zbMath0889.03029MaRDI QIDQ4370034
Publication date: 25 May 1998
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On pseudorandomness and resource-bounded measure, Pseudorandom generators without the XOR lemma, A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes, \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\), New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes., Polylog depth, highness and lowness for E, A zero-one law for RP and derandomization of AM if NP is not small