Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On optimal language compression for sets in PSPACE/poly   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|).

11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph