Pseudorandom generators and the frequency of simplicity

zbMath0862.94014MaRDI QIDQ2563546

Hemaspaandra, Lane A., Yenjo Han

Publication date: 26 May 1997

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

computational complexity; Kolmogorov complexity; pseudorandom generators

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

65C10: Random number generation in numerical analysis