A zero-one law for RP and derandomization of AM if NP is not small (Q2389331): Difference between revisions

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import recommendations run Q6767936
 
Property / Recommended article
 
Property / Recommended article: Q2753664 / rank
 
Normal rank
Property / Recommended article: Q2753664 / qualifier
 
Similarity Score: 0.8365187
Amount0.8365187
Unit1
Property / Recommended article: Q2753664 / qualifier
 
Property / Recommended article
 
Property / Recommended article: On uniform amplification of hardness in NP / rank
 
Normal rank
Property / Recommended article: On uniform amplification of hardness in NP / qualifier
 
Similarity Score: 0.8228416
Amount0.8228416
Unit1
Property / Recommended article: On uniform amplification of hardness in NP / qualifier
 
Property / Recommended article
 
Property / Recommended article: A Note on Randomized Polynomial Time / rank
 
Normal rank
Property / Recommended article: A Note on Randomized Polynomial Time / qualifier
 
Similarity Score: 0.82142687
Amount0.82142687
Unit1
Property / Recommended article: A Note on Randomized Polynomial Time / qualifier
 
Property / Recommended article
 
Property / Recommended article: On circuit lower bounds from derandomization / rank
 
Normal rank
Property / Recommended article: On circuit lower bounds from derandomization / qualifier
 
Similarity Score: 0.8161593
Amount0.8161593
Unit1
Property / Recommended article: On circuit lower bounds from derandomization / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4938630 / rank
 
Normal rank
Property / Recommended article: Q4938630 / qualifier
 
Similarity Score: 0.8139262
Amount0.8139262
Unit1
Property / Recommended article: Q4938630 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computing and Combinatorics / rank
 
Normal rank
Property / Recommended article: Computing and Combinatorics / qualifier
 
Similarity Score: 0.8136638
Amount0.8136638
Unit1
Property / Recommended article: Computing and Combinatorics / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5009542 / rank
 
Normal rank
Property / Recommended article: Q5009542 / qualifier
 
Similarity Score: 0.8115761
Amount0.8115761
Unit1
Property / Recommended article: Q5009542 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Round Complexity of Common Randomness Generation: The Amortized Setting / rank
 
Normal rank
Property / Recommended article: Round Complexity of Common Randomness Generation: The Amortized Setting / qualifier
 
Similarity Score: 0.80966717
Amount0.80966717
Unit1
Property / Recommended article: Round Complexity of Common Randomness Generation: The Amortized Setting / qualifier
 
Property / Recommended article
 
Property / Recommended article: Hardness amplification within NP against deterministic algorithms / rank
 
Normal rank
Property / Recommended article: Hardness amplification within NP against deterministic algorithms / qualifier
 
Similarity Score: 0.808975
Amount0.808975
Unit1
Property / Recommended article: Hardness amplification within NP against deterministic algorithms / qualifier
 
Property / Recommended article
 
Property / Recommended article: Relative to a random oracle, NP is not small / rank
 
Normal rank
Property / Recommended article: Relative to a random oracle, NP is not small / qualifier
 
Similarity Score: 0.8084966
Amount0.8084966
Unit1
Property / Recommended article: Relative to a random oracle, NP is not small / qualifier
 

Latest revision as of 07:36, 9 May 2025

scientific article
Language Label Description Also known as
English
A zero-one law for RP and derandomization of AM if NP is not small
scientific article

    Statements

    A zero-one law for RP and derandomization of AM if NP is not small (English)
    0 references
    0 references
    0 references
    15 July 2009
    0 references
    resource-bounded measure
    0 references
    derandomization
    0 references

    Identifiers