Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
DOI10.1007/s00037-023-00239-8arXiv2110.05305OpenAlexW4385550092MaRDI QIDQ6172035
Publication date: 16 August 2023
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.05305
tensor decompositionreconstruction algorithmsalgebraic algorithmblack boxsums of powers of linear formssimultaneous diagonalisation
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Commutativity of matrices (15A27) Randomized algorithms (68W20) Computational aspects in algebraic geometry (14Qxx) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Diagonalization, Jordan forms (15A20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Symmetric tensor decomposition
- Computing symmetric rank for symmetric tensors
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Derandomization and absolute reconstruction for sums of powers of linear forms
- Fast algorithms for the characteristic polynomial
- A probabilistic remark on algebraic program testing
- Reconstruction algorithms for sums of affine powers
- Lifting and recombination techniques for absolute factorization
- Fast multiplication of large numbers
- Quantum complexity of testing group commutativity
- On the max-min and tropical CP-rank conjectures
- Modern Computer Algebra
- Tensor decompositions for learning latent variable models
- Algorithmic Aspects of Machine Learning
- Topology and factorization of polynomials
- Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Factoring multivariate polynomials via partial differential equations
- Verification of Identities
- Determinant Equivalence Test over Finite Fields and over Q
- Reconstruction of Full Rank Algebraic Branching Programs
- Polynomial Equivalence Problems for Sum of Affine Powers
- Testing commutativity of a group and the power of randomization
- Reconstruction of non-degenerate homogeneous depth three circuits
- Smoothed analysis of tensor decompositions
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
