Schur Polynomials Do Not Have Small Formulas If the Determinant does not-Reference-Cited by-同舟云学术

Schur Polynomials Do Not Have Small Formulas If the Determinant does not

Published:2023-05-13 Issue:1 Volume:32 Page:
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Chaugule Prasad,Kumar Mrinal,Limaye Nutan,Mohapatra Chandra Kanta,She Adrian,Srinivasan Srikanth

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00037-023-00236-x.pdf

Reference45 articles.

1. Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay & S. Raja (2019). Randomized Polynomial-Time Identity Testing for Non commutative Circuits. Theory of Computing 15(7), 1–36.

2. Markus Bläser & Gorav Jindal (2018). On the Complexity of Symmetric Polynomials. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Avrim Blum, editor, volume 124 of Leibniz International Proceedings in Informatics (LIPIcs), 47:1–47:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. ISBN 978-3-95977-095-8. ISSN 1868-8969 URL http://drops.dagstuhl.de/opus/volltexte/2018/10140.

3. Peter Bürgisser (2000). Completeness and Reduction in Algebraic Complexity Theory, volume 7 of Algorithms and computation in mathematics.Springer. ISBN 978-3-540-66752-0.

4. Cy Chan, Vesselin Drensky, Alan Edelman, Raymond Kan & Plamen Koev (2019). On computing Schur functions and series thereof. Journal of Algebraic Combinatorics 50(2), 127–141. ISSN 1572-9192.URL https://doi.org/10.1007/s10801-018-0846-y.

5. Xi Chen, Neeraj Kayal & Avi Wigderson (2011). Partial Derivatives in Arithmetic Complexity. Foundations and Trends in Theoretical Computer Science .