Randomness vs time: Derandomization under a uniform assumption (Q1604214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4818849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs / 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: Oracles and queries that are sufficient for exact learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / 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: Q3359734 / 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: Hardness and hierarchy theorems for probabilistic quasi-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pseudorandom Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Yao’s XOR-Lemma / 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: Q4252738 / 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: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / 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: Q3912481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank

Latest revision as of 10:27, 4 June 2024

scientific article
Language Label Description Also known as
English
Randomness vs time: Derandomization under a uniform assumption
scientific article

    Statements

    Randomness vs time: Derandomization under a uniform assumption (English)
    0 references
    0 references
    0 references
    4 July 2002
    0 references

    Identifiers