Pages that link to "Item:Q2576937"
From MaRDI portal
The following pages link to What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937):
Displaying 14 items.
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- Limits on the computational power of random strings (Q1951574) (← links)
- On low for speed oracles (Q2009647) (← links)
- On the computational power of random strings (Q2271990) (← links)
- Polynomial clone reducibility (Q2436621) (← links)
- Reductions to the set of random strings: the resource-bounded case (Q2878751) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← 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)
- On Low for Speed Oracles (Q3304109) (← links)
- A MINIMAL SET LOW FOR SPEED (Q5052019) (← links)
- STACS 2004 (Q5309733) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)