It is possible to define the determinant of a tensor.
We think of a tensor as a collection of numbers but this collection easily extends to a proper multilinear map.
If $T:\{1,....,n\}^m\to \mathbb C$ then one can define 
$$\operatorname{Det}T:=\sum\_{\sigma\_2,...,\sigma\_m\in S\_n}\left(\left[\prod\_{i=2}^m\operatorname{Sign}\sigma\_i\right]\left[\prod\_{k=1}^n T(k,\sigma\_2(k),...,\sigma\_m(k))\right]\right).$$


This determinant satisfies some rules that are similar to the normal determinant. For example, if we add a slice to a different slice then the determinant remains the same (for matrices, if we add one column to another one then the determinant does not change). If we view map $T$ as a tensor then the value of the determinant is also invariant under a change of basis (if the transition matrix has determinant one).


For fixed $m$, the naive algorithm to determine the number runs in $O(n!^{m-1})$ (ie not very efficiently). It would be very helpful to have an efficient algorithm to make some small calculations, or even knowing the computational complexity of calculating this number would be very helpful (preferably polynomial, of course). If there is any literature on this determinant (I have not been able to find any on this) then this would also be hugely welcomed.



Looking for a tractable algorithm or formula for the determinant of a tensor
This is the Cayley hyperdeterminant, see [1,2], which is believed to be an NP-hard computation [3].


1. F. Gherardelli, Osservazioni sugli iperdeterminanti, Istit.
Lombardo Accad. Sci. Lett. Rend. A 127, 107 (1993).
2. [The Cayley
Determinant of the Determinant Tensor and the Alon Tarsi
Conjecture](https://core.ac.uk/download/pdf/82389992.pdf) (1997).
3. [On the hardness of the noncommutative determinant](https://arxiv.org/abs/0910.2370) (2009).


