On the permanent of random tensors
By: Malihe Nobakht Kooshkghazi, Hamidreza Afshin
Potential Business Impact:
Finds a shortcut for hard math problems.
The exact computation of permanent for high-dimensional tensors is a hard problem. Having in mind the applications of permanents in other fields, providing an algorithm for the approximation of tensor permanents is an attractive subject. In this paper, we design a deterministic quasi-polynomial time algorithm and a PTAS that computes the permanent of complex random tensors that its module of the mean is at least 1/polylog(n).
Similar Papers
Optimizing and benchmarking the computation of the permanent of general matrices
Quantum Physics
Calculates a hard math problem for computers.
Permanental rank versus determinantal rank of random matrices over finite fields
Computational Complexity
Makes computers understand random math better.
An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
Discrete Mathematics
Calculates a hard math problem for computers.