Subhayan Saha

Follow

Generating author description...

Common Coauthors
Coauthor Papers Together
Pascal Koiran 6
Commonly Cited References
Action Title Year Authors # of times referenced
+ Algorithmic Aspects of Machine Learning 2018 Ankur Moitra
2
+ Tensor Decompositions and Applications 2009 Tamara G. Kolda
Brett W. Bader
2
+ Computing symmetric rank for symmetric tensors 2010 Alessandra Bernardi
Alessandro Gimigliano
Monica Idà
2
+ PDF Chat Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits 2021 Vishwas Bhargava
Shubhangi Saraf
Ilya Volkovich
2
+ PDF Chat Smoothed analysis of tensor decompositions 2014 Aditya Bhaskara
Moses Charikar
Ankur Moitra
Aravindan Vijayaraghavan
2
+ Four lectures on polynomial absolute factorization 2005 Guillaume Chèze
André Galligo
1
+ PDF Chat Sylvester’s identity and multistep integer-preserving Gaussian elimination 1968 E.H. Bareiss
1
+ A Decomposition for Three-Way Arrays 1993 Sue E. Leurgans
R. Ross
Robert Abel
1
+ Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics 1977 Joseph B. Kruskal
1
+ PDF Chat On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines 1989 Lenore Blum
M. Shub
Steve Smale
1
+ PDF Chat Fourier PCA and robust tensor decomposition 2014 Navin Goyal
Santosh Vempala
Ying Xiao
1
+ Lifting and recombination techniques for absolute factorization 2007 Guillaume Chèze
Grégoire Lecerf
1
+ PDF Chat Testing commutativity of a group and the power of randomization 2012 Igor Pak
1
+ Complexity theory and numerical analysis 1997 Steve Smale
1
+ PDF Chat Reconstruction Algorithms for Sums of Affine Powers 2017 Ignacio García-Marco
Pascal Koiran
Timothée Pecatte
1
+ Symmetric tensor decomposition 2010 Jérôme Brachat
Pierre Comon
Bernard Mourrain
Elias Tsigaridas
1
+ Polynomial Equivalence Problems for Sum of Affine Powers 2018 Ignacio García-Marco
Pascal Koiran
Timothée Pecatte
1
+ PDF Chat A PSPACE construction of a hitting set for the closure of small algebraic circuits 2018 Michael A. Forbes
Amir Shpilka
1
+ PDF Chat Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time 2020 Jess Banks
Jorge Garza-Vargas
Archit Kulkarni
Nikhil Srivastava
1
+ PDF Chat Derandomization and absolute reconstruction for sums of powers of linear forms 2021 Pascal Koiran
Mateusz Skomra
1
+ Tensor Reconstruction Beyond Constant Rank 2022 Shir Peleg
Amir Shpilka
Ben Lee Volk
1
+ Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision 2022 Pascal Koiran
Subhayan Saha
1
+ PDF Chat Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision 2023 Pascal Koiran
Subhayan Saha
1
+ Tensor rank is NP-complete 1989 Johan Håstad
1
+ How hard is the tensor rank? 2016 Yaroslav Shitov
1
+ Probabilistic algorithms for sparse polynomials 1979 Richard Zippel
1
+ PDF Chat Reducing the number of variables of a polynomial 2006 Enrico Carlini
1
+ PDF Chat Topology and factorization of polynomials 2009 Hani Shaker
1
+ PDF Chat Quantum Complexity of Testing Group Commutativity 2007 Frédéric Magniez
Ashwin Nayak
1