DocumentCode
3152218
Title
On languages with very high information content
Author
Book, Ronald V. ; Lutz, Jack H.
Author_Institution
Dept. of Math., California Univ., Santa Barbara, CA, USA
fYear
1992
fDate
22-25 Jun 1992
Firstpage
255
Lastpage
259
Abstract
It is shown that any language in ESPACE that is bounded truth-table reducible in polynomial time to a set with very high space-bounded Kolmogorov complexity must be bounded truth-table reducible in polynomial time to a sparse set
Keywords
computability; computational complexity; formal languages; formal logic; ESPACE; exponential space; polynomial time; space-bounded Kolmogorov complexity; truth-table reducible; very high information content; Books; Character recognition; Computational modeling; Computer science; Information retrieval; Lifting equipment; Mathematics; Polynomials; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual
Conference_Location
Boston, MA
Print_ISBN
0-8186-2955-X
Type
conf
DOI
10.1109/SCT.1992.215400
Filename
215400
Link To Document