Tensor calculus over semirings is shown relevant to complexity theory in unexpected ways. First, evaluating well-formed tensor formulas with explicit tensor entries is shown complete for $\olpus\P$, for $\NP$, and for $\#\P$ as the semiring varies. Indeed the permanent of a matrix is shown expressible as the value of a ...
more >>>