Complexity of the \(r\)-query tautologies in the presence of a generic oracle (Q1861135): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1305/ndjfl/1038234608 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133854625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded query machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded query machines: on NP and PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic oracles, uniform machines, and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the notions of forcing and generic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of forcing to hierarchy problems in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to independence proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing and reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relativized probabilistic polynomial time algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:46, 5 June 2024

scientific article
Language Label Description Also known as
English
Complexity of the \(r\)-query tautologies in the presence of a generic oracle
scientific article

    Statements

    Complexity of the \(r\)-query tautologies in the presence of a generic oracle (English)
    0 references
    0 references
    12 March 2003
    0 references
    arithmetical forcing
    0 references
    random oracle
    0 references
    computational complexity
    0 references
    generic oracle
    0 references
    Cantor space
    0 references

    Identifiers