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 coRP, which is shown by a reduction to polynomial identity testing. Conversely, the compressed word problem for the linear group SL3(Z) is equivalent to polynomial identity testing. In the paper, it is shown that the compressed word...
