Searching for "What can be efficiently reduced to the Kolmogorov-random strings?" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

What Can be Efficiently Reduced to the Kolmogorov-Random Strings?
by Eric Allender, Harry Buhrman, Michal Koucký — 2004 — Electronic Colloquium on Computational Complexity, Report
…What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Eric Allender∗† Rutgers…
Cited by 6 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB