Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Isomorphisms and 1-L reductions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Counting classes: thresholds, parity, mods, and fewness
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Journal of Computer and System Sciences
Upward separation for FewP and related classes
Information Processing Letters
A note on logspace optimization
Computational Complexity
Polynomial-time isomorphism of 1-L-complete sets
Journal of Computer and System Sciences
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Non-commutative arithmetic circuits: depth reduction and size lower bounds
Theoretical Computer Science
SIAM Journal on Computing
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Making Nondeterminism Unambiguous
SIAM Journal on Computing
Sparse sets and collapse of complexity classes
Information and Computation
Resource-Bounded Kolmogorov Complexity Revisited
SIAM Journal on Computing
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Unambiguous Class Possessing a Complete Set
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Unambiguity and Fewness for Logarithmic Space
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Isolation, Matching, and Counting
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computational Complexity
| Hi-index | 0.00 |
P-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of L-printable sets was defined by Fortnow et al.; both P-printability and L-printability were shown to be related to notions of resource-bounded Kolmogorov complexity. Nondeterministic logspace (NL)-printability was defined by Jenner and Kirsig, but some basic questions regarding this notion were left open. In this paper we answer a question of Jenner and Kirsig by providing a machine-based characterization of the NL-printable sets.In order to relate NL-printability to resource-bounded Kolmogorov complexity, the paper introduces nondeterministic space-bounded Kolmogorov complexity. We present some of the basic properties of this notion of Kolmogorov complexity.Using similar techniques, we investigate relationships among classes between NL and UL.