Author :
Fortnow, Lance ; Goldsmith, Judy ; Levy, Matthew A. ; Mahaney, Stephen
Author_Institution :
Dept. of Comput. Sci., Chicago Univ., IL, USA
Abstract :
Properties of L-printable sets are considered, and it is shown that two sets A and B that are L-printable and have similar density are L-isomorphic. L-printable sets are characterized as those sets L-isomorphic to tally sets in L, and as subsets of KS[k log n, k log n]. Several classes of L-printable sets are given, including sparse regular and context-free sets; a characterization of sparse regular sets is given. The relationship of the sparse sets in L to the sparse L-rank able and L-printable sets is considered, and strong indications are given that these classes are all different. An oracle is constructed relative to which there are sparse L-rankable sets that are in L and not L-printable, and L-rankable sets of similar density that are not L-isomorphic
Keywords :
automata theory; computational complexity; L-printable sets; complexity; context-free sets; oracle; sparse regular; Complexity theory; Polynomials; Turing machines;
Conference_Titel :
Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
Conference_Location :
Philadelphia, PA
Print_ISBN :
0-8186-7386-9
DOI :
10.1109/CCC.1996.507673