arXiv · 2505.07000
On the permanent of random tensors
Abstract
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).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Malihe Nobakht Kooshkghazi, Hamidreza Afshin. 2025-05-11. On the permanent of random tensors. https://arxiv.org/abs/2505.07000
Cite the original work for its findings. Save a collection to share your selection of sources.