Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
- 3 August 2023
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 32 (2) , 1-66
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Computing symmetric rank for symmetric tensorsJournal of Symbolic Computation, 2011
- Symmetric tensor decompositionLinear Algebra and its Applications, 2010
- Quantum Complexity of Testing Group CommutativityAlgorithmica, 2007
- Lifting and recombination techniques for absolute factorizationJournal of Complexity, 2007
- Factoring multivariate polynomials via partial differential equationsMathematics of Computation, 2002
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Fast algorithms for the characteristics polynomialTheoretical Computer Science, 1985
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A probabilistic remark on algebraic program testingInformation Processing Letters, 1978
- Sylvester’s identity and multistep integer-preserving Gaussian eliminationMathematics of Computation, 1968