NL-printable sets and Nondeterministic Kolmogorov Complexity

This paper introduces nondeterministic space-bounded Kolmogorov complexity, and we show that it has some nice properties not shared by some other resource-bounded notions of K-complexity