关于PSPACE中集合的最优压缩
On the optimal compression of sets in PSPACE
摘要：
如果DTIME[2^{O（n）}]不包含在DSPACE[2^{o（n）}]中，则对于PSPACE中的每个集合B，B中长度为n的所有字符串x都可以由长度至多为log（|B^{=n}|）+ O（log n），这样一个多项式时间算法，给定compressed（x），可以将x从B^{=n}中的所有其他字符串中区分出来。模的O（log n）的附加trem，这实现了字符串压缩的信息理论最佳。
英文摘要：
We show that if DTIME[2^{O(n)}] is not included in DSPACE[2^{o(n)}], then, for every set B in PSPACE, all strings x in B of length n can be represented by a string compressed(x) of length at most log (|B^{=n}|) + O(log n), such that a polynomial-time algorithm, given compressed(x), can distinguish x from all the other strings in B^{=n}. Modulo the O(log n) additive trem, this achieves the information-theoretical optimum for string compression.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
