Sparse interpolation of symmetric polynomials
From MaRDI portal
Publication:678607
DOI10.1006/AAMA.1996.0508zbMATH Open0866.68045OpenAlexW2066766330WikidataQ105614372 ScholiaQ105614372MaRDI QIDQ678607FDOQ678607
Authors: Alexander Barvinok, Sergey Fomin
Publication date: 6 July 1997
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0b8c9014d2a3dfff091c1ab66a23500fecb9c5a1
Recommendations
Analysis of algorithms and problem complexity (68Q25) Interpolation in approximation theory (41A05) Differential algebra (12H05)
Cites Work
- Title not available (Why is that?)
- The representation theory of the symmetric groups
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On the computational power of pushdown automata
- Title not available (Why is that?)
- Fast Parallel Matrix Inversion Algorithms
- The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
- Multiplying Schur functions
Cited In (10)
- An SVD analysis of equispaced polynomial interpolation
- The number of steps in the Robinson-Schensted algorithm
- Saxl conjecture for triple hooks
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- Interpolation with symmetric polynomials
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Sparse polynomial interpolation in Chebyshev bases
- Sparse polynomial interpolation with finitely many values for the coefficients
- An algorithm for the multiplication of symmetric polynomials
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)