Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Dimension, entropy rates, and compression
Journal of Computer and System Sciences
A note on dimensions of polynomial size circuits
Theoretical Computer Science
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
On the polynomial depth of various sets of random strings
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Increasing kolmogorov complexity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the polynomial depth of various sets of random strings
Theoretical Computer Science
| Hi-index | 0.00 |
We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under probabilistic and non-uniform reductions. These sets are provably not complete under the usual many-one reductions.Let RK; RKt; RKS;RKT be the sets of strings x having complexity at least {{\left| x \right|} \mathord{\left/ {\vphantom {{\left| x \right|} 2}} \right. \kern-\nulldelimiterspace} 2}, according to the usual Kolmogorov complexity measure K, Levin's time-bounded Kolmogorov complexity Kt [27], a space-bounded Kolmogorov measure KS, and the time-bounded Kolmogorov complexity measure KT that was introduced in [4], respectively.Our main results are:1. RKS and RKt are complete for PSPACE and EXP, respectively, under P/poly-truth-table reductions.2. EXP = NPRKt.3. PSPACE = ZPP^{R_{ks} }\subseteq P^{R_k }.4. The Discrete Log, Factoring, and several lattice problems are solvable in BPPRKT.