On Languages with Very High Information Content


The main result of this paper is the following: Any language in ESPACE that is bounded truthtable 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. 
DOI: 10.1109/SCT.1992.215400


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics