How strong is Nisan's pseudo-random generator?
type: Item
instance of: scholarly article
title: How strong is Nisan's pseudo-random generator?
zbMATH Open document ID: 1260.68283
author: Matei David
author: Periklis A. Papakonstantinou
author: Anastasios Sidiropoulos
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 65C10
zbMATH DE Number: 6150443
zbMATH Keywords: computational complexity
zbMATH Keywords: Nisan's pseudo-random generator
zbMATH Keywords: derandomization
zbMATH Keywords: space bounded
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.04.013
OpenAlex ID: W148806319
cites work: Computational Complexity
cites work: Fast parallel matrix and GCD computations
cites work: Pseudorandomness for network algorithms
cites work: Q3152808
cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
cites work: Pseudorandom generators for space-bounded computation
cites work: On read-once vs. multiple access to randomness in logspace
DOI: 10.1016/J.IPL.2011.04.013
description: scientific article; zbMATH DE number 6150443