Relativized Questions Involving Probabilistic Algorithms
From MaRDI portal
Publication:3935473
DOI10.1145/322290.322306zbMath0477.68037MaRDI QIDQ3935473
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322290.322306
Related Items
Counting classes: Thresholds, parity, mods, and fewness, Helping by unambiguous computation and probabilistic computation, On sets polynomially enumerable by iteration, Separating complexity classes with tally oracles, Oracles for structural properties: The isomorphism problem and public-key cryptography, A general method to construct oracles realizing given relationships between complexity classes, The isomorphism conjecture holds and one-way functions exist relative to an oracle, On randomized versus deterministic computation, A tight relationship between generic oracles and type-2 complexity theory, Mathematical problems in cryptology, A complexity theory for feasible closure properties, Simultaneous strong separations of probabilistic and unambiguous complexity classes