Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity

DOI10.1016/S0020-0190(97)00054-9zbMath1337.68142OpenAlexW2046926619MaRDI QIDQ290244

Marius Zimand

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00054-9

zbMATH Keywords

Kolmogorov complexity\(\mathrm{AC}^{0}\)

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

A comparison of two approaches to pseudorandomness

Cites Work

• Unnamed Item
• Pseudorandom bits for constant depth circuits
• With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
• Some consequences of the existnce of pseudorandom generators
• Pseudorandom generators and the frequency of simplicity

This page was built for publication: Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity