Title

Authors

Publication Date

4-1-1991

Technical Report Number

TR91-09a

Subjects

Mathematics of Computing, Theory of Computation

Abstract

Every language that is polynomial time many-one hard for ESPACE is shown to have unusually small complexity cores and unusually low space-bounded Kolmogorov complexity. It follows that the polynomial time many-one complete languages form a measure 0 subset of ESPACE.