Pages that link to "Item:Q1822961"
From MaRDI portal
The following pages link to Some consequences of the existnce of pseudorandom generators (Q1822961):
Displaying 7 items.
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity (Q290244) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Avoiding simplicity is complex (Q693072) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- Symmetry of information and one-way functions (Q1802066) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
