scientific article; zbMATH DE number 1304314

zbMath0928.68052MaRDI QIDQ4251044

Harry Buhrman, Lance J. Fortnow

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probabilistic computation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

NL-printable sets and nondeterministic Kolmogorov complexity ⋮ A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes ⋮ Reconstructive dispersers and hitting set generators ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Preserving Randomness for Adaptive Algorithms ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity ⋮ Unnamed Item ⋮ Easiness assumptions and hardness tests: Trading time for zero error ⋮ Simplified Derandomization of BPP Using a Hitting Set Generator