Pseudorandom generators and the frequency of simplicity

DOI10.1007/3-540-59042-0_61zbMATH Open1379.68186OpenAlexW2111169889MaRDI QIDQ4596609FDOQ4596609

Authors: Yenjo Han, Lane A. Hemaspaandra 

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_61

Recommendations

• Pseudorandom generators and the frequency of simplicity
• On the Existence of Pseudorandom Generators
• Some consequences of the existnce of pseudorandom generators
• scientific article; zbMATH DE number 1670863
• Sparse pseudorandom distributions

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (4)

• Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity
• Title not available (Why is that?)
• Some consequences of the existnce of pseudorandom generators
• Pseudorandom generators and the frequency of simplicity

This page was built for publication: Pseudorandom generators and the frequency of simplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596609)