Pages that link to "Item:Q2878751"

The following pages link to Reductions to the set of random strings: the resource-bounded case (Q2878751):

Displaying 11 items.

• Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
• What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
• Reductions to the set of random strings: the resource-bounded case (Q2878751) (← links)
• (Q2912711) (redirect page) (← links)
• Random strings and truth-table degrees of Turing complete c.e. sets (Q2921112) (← links)
• The Complexity of Complexity (Q2973719) (← links)
• On the Polynomial Depth of Various Sets of Random Strings (Q3010430) (← links)
• Limits on the Computational Power of Random Strings (Q3012814) (← links)
• Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
• (Q4708572) (← links)
• Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic (Q5414624) (← links)