Degrees of Dowd-type generic oracles
type: Item
instance of: scholarly article
title: Degrees of Dowd-type generic oracles
zbMATH Open document ID: 1012.03052
author: Toshio Suzuki
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853272
MaRDI profile type: Publication
OpenAlex ID: W1982156324
cites work: Q4863237
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: Q4321931
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Q3794177
cites work: A tight relationship between generic oracles and type-2 complexity theory
cites work: Generic oracles, uniform machines, and codes
cites work: Some applications of the notions of forcing and generic sets
cites work: Some applications of forcing to hierarchy problems in arithmetic
cites work: Q3852172
cites work: Double jumps of minimal degrees
cites work: Some observations on the probabilistic algorithms and NP-hard problems
cites work: Q4863244
cites work: On the random oracle hypothesis
cites work: A comparison of polynomial time reducibilities
cites work: Forcing and reducibilities
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Classical recursion theory. Vol. II
cites work: Q3720579
cites work: Q5573961
cites work: Q4040892
cites work: Q4246600
cites work: Complexity of the \(r\)-query tautologies in the presence of a generic oracle
DOI: 10.1006/INCO.2002.3149
description: scientific article; zbMATH DE number 1853272