Pages that link to "Item:Q2784486"
From MaRDI portal
The following pages link to Resource-bounded Kolmogorov complexity revisited (Q2784486):
Displaying 28 items.
- A linearly computable measure of string complexity (Q441859) (← links)
- Short lists for shortest descriptions in short time (Q475336) (← 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)
- Avoiding simplicity is complex (Q693072) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- On optimal language compression for sets in PSPACE/poly (Q2354585) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- On Resource-Bounded Versions of the van Lambalgen Theorem (Q2988817) (← links)
- On the Optimal Compression of Sets in PSPACE (Q3088270) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- Generation Complexity Versus Distinction Complexity (Q3502669) (← links)
- Nondeterministic Instance Complexity and Proof Systems with Advice (Q3618578) (← links)
- (Q4258583) (← links)
- Refined Bounds on Kolmogorov Complexity for ω-Languages (Q4918014) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Shiner–Davison–Landsberg complexity revisited (Q4968819) (← links)
- Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
- Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts (Q5090471) (← links)
- An incompressibility theorem for automatic complexity (Q5154787) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311121) (← links)
- On algorithmic statistics for space-bounded algorithms (Q5919540) (← links)
