Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Evaluating Matrix Circuits   The circuit evaluation problem (also known as the compressed word problem)
for finitely generated linear groups is studied. The best upper bound for this
problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial
identity testing. Conversely, the compressed word problem for the linear group
$\mathsf{SL}_3(\mathbb{Z})$ is equivalent to polynomial identity testing. In
the paper, it is shown that the compressed word problem for every finitely
generated nilpotent group is in $\mathsf{DET} \subseteq \mathsf{NC}^2$. Within
the larger class of polycyclic groups we find examples where the compressed
word problem is at least as hard as polynomial identity testing for skew
arithmetic circuits.

16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con