Pseudorandom generators for space-bounded computation
type: Item
instance of: scholarly article
title: Pseudorandom generators for space-bounded computation
zbMATH Open document ID: 0759.68024
DOI: 10.1007/BF01305237
author: Noam Nisan
published in: Combinatorica
publication date: 1993-03-10T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 130615
zbMATH Keywords: space bounded computation
zbMATH Keywords: universal hash function
zbMATH Keywords: pseudorandom generators
MaRDI profile type: Publication
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Universal classes of hash functions
cites work: Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
cites work: The computational complexity of universal hashing
cites work: Probabilistic algorithm for testing primality
cites work: On using deterministic functions to reduce randomness in probabilistic algorithms
cites work: Expanders, randomness, or time versus space
description: scientific article; zbMATH DE number 130615