Access the full text.
Sign up today, get DeepDyve free for 14 days.
Stanley Richard P. (1999)
Enumerative combinatorics. Vol. 2
Proctor Robert A. (1982)
Classical Bruhat orders and lexicographic shellabilityJ. Algebra, 77
Schnorr Claus-Peter (1976)
A lower bound on the number of additions in monotone computationsTheoret. Comput. Sci., 2
Grigoriev Dima, Koshevoy Gleb (2016)
Complexity of tropical Schur polynomialsJ. Symbolic Comput., 74
Koev Plamen (2007)
Accurate computations with totally nonnegative matricesSIAM J. Matrix Anal. Appl., 29
Narayanan Hariharan (2006)
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficientsJ. Algebraic Combin., 24
Jerrum Mark, Snir Marc (1982)
Some exact complexity results for straight-line computations over semiringsJ. Assoc. Comput. Mach., 29
Demmel James, Koev Plamen (2006)
Accurate and efficient evaluation of Schur and Jack functionsMath. Comp., 75
Strassen Volker (1973)
Vermeidung von DivisionenJ. Reine Angew. Math., 264
Björner Anders, Wachs Michelle (1982)
Bruhat order of Coxeter groups and shellabilityAdv. in Math., 43
Björner Anders, Wachs Michelle L. (1988)
Generalized quotients in Coxeter groupsTrans. Amer. Math. Soc., 308
Fomin Sergey, Grigoriev Dima, Koshevoy Gleb (2016)
Subtraction-free complexity, cluster transformations, and spanning treesFound. Comput. Math., 16
Valiant Leslie G. (1980)
Negation can be exponentially powerfulTheoret. Comput. Sci., 12
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring complexity of a Schur polynomial $${s_\lambda(x_1,\dots,x_k)}$$ s λ ( x 1 , ⋯ , x k ) labeled by a partition $${\lambda=(\lambda_1\ge\lambda_2\ge\cdots)}$$ λ = ( λ 1 ≥ λ 2 ≥ ⋯ ) is bounded by $${O(\log(\lambda_1))}$$ O ( log ( λ 1 ) ) provided the number of variables k is fixed.
Computational Complexity – Springer Journals
Published: Jun 4, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.