Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
type: Item
instance of: scholarly article
title: Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
zbMATH Open document ID: 0930.68064
DOI: 10.1016/S0304-3975(99)00024-9
author: Andrea Clementi
author: Alexander E. Andreev
author: José Rolim
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1387418
zbMATH Keywords: EXP function
MaRDI profile type: Publication
cites work: Eigenvalues and expanders
cites work: Q4004078
cites work: A new general derandomization method
cites work: Weak Random Sources, Hitting Sets, and BPP Simulations
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Q4526985
cites work: Ramanujan graphs
cites work: Q3236503
cites work: Q4856179
cites work: Q5514082
cites work: Hardness vs randomness
cites work: Q3221403
cites work: Q4234096
cites work: Q4228480
cites work: Q3762226
full work available at URL: s0304-3975(99)00024-9
OpenAlex ID: W2083027849
description: scientific article; zbMATH DE number 1387418