Pages that link to "Item:Q2784486"
From MaRDI portal
The following pages link to Resource-Bounded Kolmogorov Complexity Revisited (Q2784486):
Displayed 11 items.
- A linearly computable measure of string complexity (Q441859) (← links)
- Proof systems that take advice (Q553297) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- On the Optimal Compression of Sets in PSPACE (Q3088270) (← links)
- Generation Complexity Versus Distinction Complexity (Q3502669) (← links)
- Nondeterministic Instance Complexity and Proof Systems with Advice (Q3618578) (← links)