Hardness vs randomness
type: Item
instance of: scholarly article
title: Hardness vs randomness
zbMATH Open document ID: 0821.68057
DOI: 10.1016/S0022-0000(05)80043-1
author: Noam Nisan
author: A. Wigderson
published in: Journal of Computer and System Sciences
publication date: 1994-11-06T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 65C10
zbMATH DE Number: 682613
zbMATH Keywords: pseudorandom bit generator
zbMATH Keywords: complexity class
MaRDI profile type: Publication
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Alternation
cites work: Pseudorandom number generation and space complexity
cites work: Probabilistic encryption
cites work: Turing machines that take advice
cites work: A Note on Randomized Polynomial Time
cites work: Pseudorandom bits for constant depth circuits
cites work: Q3745279
cites work: Q3912481
Wikidata QID: Q56815522
DBLP publication ID: journals/jcss/NisanW94
description: scientific article; zbMATH DE number 682613