Sparse interpolation of symmetric polynomials
From MaRDI portal
Publication:678607
DOI10.1006/aama.1996.0508zbMath0866.68045OpenAlexW2066766330WikidataQ105614372 ScholiaQ105614372MaRDI QIDQ678607
Alexander I. Barvinok, Fomin, Sergey
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
Analysis of algorithms and problem complexity (68Q25) Interpolation in approximation theory (41A05) Differential algebra (12H05)
Related Items (4)
The number of steps in the Robinson-Schensted algorithm ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Saxl conjecture for triple hooks ⋮ On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
Cites Work
- The representation theory of the symmetric groups
- The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
- On the computational power of pushdown automata
- Multiplying Schur functions
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast Parallel Matrix Inversion Algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: Sparse interpolation of symmetric polynomials
