On semiring complexity of Schur polynomials

Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial $s_\lambda$ is $O(log(\lambda_1))$; here $\lambda_1$ is the largest part...

Full description

Saved in:
Bibliographic Details
Main Authors Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Eric
Format Journal Article
LanguageEnglish
Published 17.08.2016
Subjects
Computer Science - Computational Complexity
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary:Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial $s_\lambda$ is $O(log(\lambda_1))$; here $\lambda_1$ is the largest part of the partition $\lambda$.
DOI:10.48550/arxiv.1608.05043