The following pages link to (Q4474202):
Displaying 13 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Avoiding simplicity is complex (Q693072) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- A circuit complexity formulation of algorithmic information theory (Q6090675) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)