Apr 3, 2013 · We also observe that optimal compression is not possible for sets more complex than PSPACE/poly because for any time-constructible ...

Mar 11, 2014 · We show that hardness based pseudo-random generator constructions can be used to get improved upper bound on standard compression/decompression ...

We also observe that optimal compression is not possible for sets more complex than PSPACE/poly because for any time-constructible superpolynomial function t, ...

Apr 3, 2013 · Abstract. We show that if DTIME[2O(n)] is not included in DSPACE[2o(n)], then, for every set B in PSPACE/poly, all strings x in B of length ...

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).

For any set A in PSPACE/poly, there exists a polynomial p such that for every x ∈ A. CDp,A(x) ≤ log |A=n| + O(log n). Marius Zimand (Towson U.) Compression P, ...

TL;DR: Efficient prefix-free compression and decompression algorithms for three classes of polynomially samplable sources (whose support is a subset of {0, 1}n) ...

on Optimal Language Compression for Sets in PSPACE/poly. Vinodchandran, N.V.; Zimand, M. Theory of Computing Systems 56(3): 581-590. ISSN/ISBN: 0041-008X. 2014 ...

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).

We also observe that optimal compression is not possible for sets more complex than PSPACE/poly because for any time-constructible superpolynomial function t, ...