How strong is Nisan's pseudo-random generator? (Q1944139): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast parallel matrix and GCD computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pseudorandomness for network algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3152808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pseudorandom generators for space-bounded computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On read-once vs. multiple access to randomness in logspace / rank | |||
Normal rank |
Latest revision as of 08:40, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How strong is Nisan's pseudo-random generator? |
scientific article |
Statements
How strong is Nisan's pseudo-random generator? (English)
0 references
4 April 2013
0 references
computational complexity
0 references
Nisan's pseudo-random generator
0 references
derandomization
0 references
space bounded
0 references