Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Inapproximability of the Discrete Witsenhausen Problem   We consider a discrete version of the Witsenhausen problem where all random
variables are bounded and take on integer values. Our main goal is to
understand the complexity of computing good strategies given the distributions
for the initial state and second-stage noise as inputs to the problem.
Following Papadimitriou and Tsitsiklis [1], who showed that computing the
optimal solution is NP-complete, we construct a sequence of problem instances
with the initial state uniform over a set of size $n$ and the noise uniform
over a set of size at most $n^2$, such that finding a strategy whose cost is a
multiplicative $n^{2-\epsilon}$ approximation to the optimal cost is NP-hard
for any $\epsilon > 0$.

8
The categories of this paper are: hep-ex
18
The categories of this paper are: econ
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
15
The categories of this paper are: nucl-ex
36
The categories of this paper are: cmp-lg