Sparse interpolation of symmetric polynomials
From MaRDI portal
(Redirected from Publication:678607)
Recommendations
Cites work
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Fast Parallel Matrix Inversion Algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Multiplying Schur functions
- On the computational power of pushdown automata
- The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
- The representation theory of the symmetric groups
Cited in
(10)- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- An algorithm for the multiplication of symmetric polynomials
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- Saxl conjecture for triple hooks
- An SVD analysis of equispaced polynomial interpolation
- Sparse polynomial interpolation in Chebyshev bases
- The number of steps in the Robinson-Schensted algorithm
- Interpolation with symmetric polynomials
- Sparse polynomial interpolation with finitely many values for the coefficients
This page was built for publication: Sparse interpolation of symmetric polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678607)