scientific article; zbMATH DE number 7561742
From MaRDI portal
Publication:5092463
DOI10.4230/LIPIcs.CCC.2020.14MaRDI QIDQ5092463
Adrian She, Nutan Limaye, Prasad Chaugule, Mrinal Kumar, Chandra Kanta Mohapatra, Srikanth Srinivasan
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1911.12520
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
JacobianSchur polynomiallower boundTaylor expansiongeneralized Vandermonde determinantalgebraic independenceformula complexity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homogeneous formulas and symmetric polynomials
- Complexity of tropical Schur polynomials
- On the ranks and border ranks of symmetric tensors
- On the number of reduced decompositions of elements of Coxeter groups
- Lower bounds on arithmetic circuits via partial derivatives
- Completeness and reduction in algebraic complexity theory
- On semiring complexity of Schur polynomials
- On the relative power of reduction notions in arithmetic circuit complexity
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- Quantum spectrum testing
- On computing Schur functions and series thereof
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Arithmetic Circuits: A Chasm at Depth 3
- Partial Derivatives in Arithmetic Complexity and Beyond
- Fast Parallel Computation of Polynomials Using Few Processors
- Arithmetic Circuits: A survey of recent results and open questions
- Normal subgroup reconstruction and quantum computation using group representations
- Accurate Computations with Totally Nonnegative Matrices
- Diagonal Circuit Identity Testing and Lower Bounds
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
- Discovering the roots: uniform closure results for algebraic classes under factoring
- Accurate and efficient evaluation of Schur and Jack functions
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Depth-3 arithmetic circuits over fields of characteristic zero
- Subtraction-free complexity, cluster transformations, and spanning trees
