Complexity of tropical Schur polynomials
From MaRDI portal
Publication:898243
DOI10.1016/j.jsc.2015.05.005zbMath1329.65060OpenAlexW654250349MaRDI QIDQ898243
Gleb A. Koshevoy, Dima Yu. Grigoriev
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2015.05.005
Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20) Semifields (12K10) Semirings (16Y60)
Related Items
On semiring complexity of Schur polynomials, Schur polynomials do not have small formulas if the determinant does not, Matrix representation of formal polynomials over max-plus algebra, Unnamed Item, Tropicalization, symmetric polynomials, and complexity, Tropical Complexity, Sidon Sets, and Dynamic Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bessenrodt-Stanley polynomials and the octahedron recurrence
- Schur function expansion for normal matrix model and associated discrete matrix models
- Negation can be exponentially powerful
- Submodular functions and optimization
- Discrete convexity and unimodularity. I.
- Parametrizations of canonical bases and totally positive matrices
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Discrete strip-concave functions, Gelfand--Tsetlin patterns, and related polyhedra
- From Palev’s Study of Wigner Quantum Systems to New Results on Sums of Schur Functions
- Combinatorial geometries and torus strata on homogeneous compact manifolds
- Some Exact Complexity Results for Straight-Line Computations over Semirings
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- Tropical algebraic geometry