The random oracle hypothesis is false (Q1333397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/jcss/ChangCGHHRR94, #quickstatements; #temporary_batch_1731508824982
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / 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: 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: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy I: Structural Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle hypothesis is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are there interactive protocols for co-NP languages? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural complexity theory: Recent surprises / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism conjecture fails relative to a random oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(05)80084-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016506875 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/ChangCGHHRR94 / rank
 
Normal rank

Latest revision as of 15:55, 13 November 2024

scientific article
Language Label Description Also known as
English
The random oracle hypothesis is false
scientific article

    Statements

    The random oracle hypothesis is false (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 1994
    0 references
    random oracle hypothesis
    0 references
    complexity classes
    0 references

    Identifiers