PSPACE/poly中集合的最优语言压缩
On optimal language compression for sets in PSPACE/poly
摘要:
我们证明了,如果DTIME[2^O(n)]不包含在DSPACE[2^O(n)]中,那么对于PSPACE/poly中的每个集合B,B中长度为n的所有字符串x都可以由长度至多为log(|B^{=n}|)+O(log n),这样一个多项式时间算法,给定compressed(x),可以将x从B^{=n}中的所有其他字符串中区分出来。模的O(log n)的附加项,这实现了字符串压缩的信息理论的最佳。我们还观察到,对于比PSPACE/poly更复杂的集合,最佳压缩是不可能的,因为对于任何时间可构造的超多项式函数t,存在在空间t(n)中可计算的集合A,使得至少一个长度为n的字符串x需要compressed(x)的长度为2 log(|A^=n|).
英文摘要:
We show that if DTIME[2^O(n)] is not included in DSPACE[2^o(n)], then, for every set B in PSPACE/poly, 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 term, this achieves the information-theoretic optimum for string compression. We also observe that optimal compression is not possible for sets more complex than PSPACE/poly because for any time-constructible superpolynomial function t, there is a set A computable in space t(n) such that at least one string x of length n requires compressed(x) to be of length 2 log(|A^=n|).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。