Randomness vs time: Derandomization under a uniform assumption
type: Item
instance of: scholarly article
title: Randomness vs time: Derandomization under a uniform assumption
zbMATH Open document ID: 1052.68034
author: Russell Impagliazzo
author: A. Wigderson
published in: Journal of Computer and System Sciences
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 1763418
MaRDI profile type: Publication
full work available at URL: jcss.2001.1780
OpenAlex ID: W2062855793
cites work: Q4818849
cites work: Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
cites work: A new general derandomization method
cites work: Weak Random Sources, Hitting Sets, and BPP Simulations
cites work: Oracles and queries that are sufficient for exact learning
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
cites work: Q3359734
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Hardness and hierarchy theorems for probabilistic quasi-polynomial time
cites work: On the Existence of Pseudorandom Generators
cites work: On Yao’s XOR-Lemma
cites work: A Pseudorandom Generator from any One-way Function
cites work: Q4252738
cites work: Extractors and pseudo-random generators with optimal seed length
cites work: Q4526985
cites work: Turing machines that take advice
cites work: One way functions and pseudorandom generators
cites work: Q4871218
cites work: Average Case Complete Problems
cites work: Q3210157
cites work: Pseudorandom bits for constant depth circuits
cites work: Hardness vs randomness
cites work: Natural proofs
cites work: Q3912481
cites work: PP is as Hard as the Polynomial-Time Hierarchy
DOI: 10.1006/JCSS.2001.1780
description: scientific article; zbMATH DE number 1763418