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 larges...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Eric
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 19.05.2018
Subjects
Circuits
Complexity
Mathematical analysis
Multiplication
Polynomials
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\).
ISSN:2331-8422