On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-030-41672-0_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2918847199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On basing one-way functions on NP-hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum for / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and circuit minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the computational power of random strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning algorithms from natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Self-Reducibility of Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Hardness vs. Randomness under Uniform Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key agreement from weak bit agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On helping by robust oracle machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Learning Minimum Time-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conservation inequalities; information and independence in mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and average-case complexity via uniform reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Study of Computational Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank

Latest revision as of 03:00, 23 July 2024

scientific article
Language Label Description Also known as
English
On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets
scientific article

    Statements

    On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (English)
    0 references
    0 references
    0 references
    20 July 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers