The Complexity of Tensor Calculus

  • Authors:

  • Carsten Damm;Markus Holzer;Pierre McKenzie

  • Affiliations:

  • -;-;-

  • Venue:
  • COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 \mathP, for NP, and for #P as the semiring varies. Indeed the permanent of a matrix is shown expressible as the value of a tensor formula in much the same way that Berkowitz' theorem expresses its determinant. Second, restricted tensor formulas are shown to capture the classes LOGCFL and NL, their parity counterparts place \mathLOGCFL and place \mathL, and several other counting classes. Finally, the known inclusions NP/poly \math\mathP/poly, LOGCFL/poly \math\mathLOGCFL/poly, and NL/poly \math\mathL/poly, which have scattered proofs in the literature [21, 39], are shown to follow from the new characterizations in a single blow.