Author:
Koiran Pascal,Saha Subhayan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference41 articles.
1. Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M.
Kakade & Matus Telgarsky (2014). Tensor Decompositions
for Learning Latent Variable Models. Journal of Machine Learning
Research 15(80), 2773–2832. URL http://jmlr.org/papers/v15/anandkumar14b.html.
2. Erwin H. Bareiss (1968). Sylvester’s Identity and Multistep
Integer-Preserving Gaussian Elimination. Mathematics of Computation 22(103), 565–578. ISSN 00255718, 10886842. URL http://www.jstor.org/stable/2004533.
3. Alessandra Bernardi, Alessandro Gimigliano & Monica Ida
(2011). Computing symmetric rank for symmetric tensors. Journal of
Symbolic Computation 46(1), 34–53.
4. Vishwas Bhargava, Shubhangi Saraf & Ilya Volkovich (2021).
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear
Circuits. In Proceedings of the 53rd Annual ACM SIGACT Symposium
on Theory of Computing (STOC). URL https://doi.org/10.1145/3406325.3451096.
5. Aditya Bhaskara, Moses Charikar, Ankur Moitra & Aravindan
Vijayaraghavan (2014). Smoothed Analysis of Tensor Decompositions.
In Proceedings of the Forty-Sixth Annual ACM Symposium
on Theory of Computing, STOC. URL https://doi.org/10.1145/2591796.2591881.