Fetching the paper…
Reading the bibliography…
Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike.
Closure of VP under taking factors: a short and simple proof
Chi-Ning Chou, Mrinal Kumar, and Noam Solomon · 1903
Earlier work this paper cites.
Generalized Vandermonde Determinants
E. R. Heineman · 1929
Earlier work this paper cites.
Symmetric functions and Hall polynomials
Ian G. Macdonald · 1979
Earlier work this paper cites.
Fast Parallel Computation of Polynomials Using Few Processors
Leslie G. Valiant, Sven Skyum, S. Berkowitz, and Charles Rackoff · 1981
Earlier work this paper cites.
On the number of reduced decompositions of elements of Coxeter groups
Richard P Stanley · 1984
Earlier work this paper cites.
Factorization of Polynomials Given by Straight-Line Programs
Erich Kaltofen · 1989
Earlier work this paper cites.
Incomparability graphs of (3+ 1)-free posets are s-positive
Vesselin Gasharov · 1996
Earlier work this paper cites.
Lower bounds on arithmetic circuits via partial derivatives
Noam Nisan and Avi Wigderson · 1997
Earlier work this paper cites.
Enumerative combinatorics. Vol. 2, volume 62 of
Richard P Stanley · 1999
Earlier work this paper cites.
Depth-3 arithmetic circuits over fields of characteristic zero
Amir Shpilka and Avi Wigderson · 1999
Earlier work this paper cites.
Normal subgroup reconstruction and quantum computation using group representations
Sean Hallgren, Alexander Russell, and Amnon Ta-Shma · 2000
Earlier work this paper cites.
The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions
Bruce Sagan · 2001
Earlier work this paper cites.
Affine Projections of Symmetric Polynomials
Amir Shpilka · 2001
Earlier work this paper cites.
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Valentine Kabanets and Russell Impagliazzo · 2003
Earlier work this paper cites.
Accurate and Efficient Evaluation of Schur and Jack Functions
James Demmel and Plamen Koev · 2006
Cited alongside, same era.
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
Hariharan Narayanan · 2006
Cited alongside, same era.
Generatingfunctionology
Herbert S. Wilf · 2006
Cited alongside, same era.
Accurate Computations with Totally Nonnegative Matrices
Plamen. Koev · 2007
Cited alongside, same era.
Diagonal Circuit Identity Testing and Lower Bounds
Nitin Saxena · 2008
Cited alongside, same era.
Arithmetic Complexity and Symmetry , 2009
Dick Lipton and Ken Regan · 2009
Cited alongside, same era.
Ryan O’Donnell and John Wright · 2015
Later among the works it cites.
Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees
Sergey Fomin, Dima Grigoriev, and Gleb Koshevoy · 2016
Later among the works it cites.
Complexity of tropical Schur polynomials
Dima Grigoriev and Gleb Koshevoy · 2016
Later among the works it cites.
Arithmetic Circuits: A Chasm at Depth 3
Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi · 2016
Later among the works it cites.
Luke Oeding · 2016
Later among the works it cites.
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Zeev Dvir, Amir Shpilka, and Amir Yehudayoff · 2010
Cited alongside, same era.
Introductory Schubert calculus
Veerle Ledoux and Simon JA Malham · 2010
Cited alongside, same era.
On the Ranks and Border Ranks of Symmetric Tensors
J. M. Landsberg and Zach Teitler · 2010
Cited alongside, same era.
Arithmetic Circuits: A survey of recent results and open questions
Amir Shpilka and Amir Yehudayoff · 2010
Cited alongside, same era.
Partial Derivatives in Arithmetic Complexity
Xi Chen, Neeraj Kayal, and Avi Wigderson · 2011
Cited alongside, same era.
Homogeneous Formulas and Symmetric Polynomials
Pavel Hrubes and Amir Yehudayoff · 2011
Cited alongside, same era.
Hervé Fournier, Nutan Limaye, Meena Mahajan, and Srikanth Srinivasan · 2017
Later among the works it cites.
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Christian Ikenmeyer and Greta Panova · 2017
Later among the works it cites.
On the Complexity of Symmetric Polynomials
Markus Bläser and Gorav Jindal · 2018
Later among the works it cites.
Some Closure Results for Polynomial Factorization and Applications
Chi-Ning Chou, Mrinal Kumar, and Noam Solomon · 2018
Later among the works it cites.
Discovering the roots: Uniform closure results for algebraic classes under factoring
Pranjal Dutta, Nitin Saxena, and Amit Sinhababu · 2018
Later among the works it cites.
On Semiring Complexity of Schur Polynomials
Sergey Fomin, Dima Grigoriev, Dorian Nogneng, and Éric Schost · 2018
Later among the works it cites.
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, and S. Raja · 2019
Closest in time.
On computing Schur functions and series thereof
Cy Chan, Vesselin Drensky, Alan Edelman, Raymond Kan, and Plamen Koev · 2019
Closest in time.