Pseudo-random generators for all hardnesses (Q5917585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: A new general derandomization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Random Sources, Hitting Sets, and BPP Simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified Derandomization of BPP Using a Hitting Set Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: List decoding algorithms for certain concatenated codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors and pseudo-random generators with optimal seed length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easiness assumptions and hardness tests: Trading time for zero error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Arthur-Merlin games under uniform assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Arthur-Merlin games using hitting sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors from Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors and pseudorandom generators / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 7 June 2024

scientific article; zbMATH DE number 2116463
Language Label Description Also known as
English
Pseudo-random generators for all hardnesses
scientific article; zbMATH DE number 2116463

    Statements

    Pseudo-random generators for all hardnesses (English)
    0 references
    0 references
    18 November 2004
    0 references
    Pseudo-random number generators
    0 references
    Derandomization
    0 references
    Complexity classes
    0 references
    Low-degree extension
    0 references

    Identifiers