scientific article; zbMATH DE number 7561742

DOI10.4230/LIPICS.CCC.2020.14MaRDI QIDQ5092463zbMATH OpenFDO

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

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1911.12520

zbMATH Keywords

algebraic independenceformula complexitygeneralized Vandermonde determinantJacobianlower boundSchur polynomialTaylor expansion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A deterministic PTAS for the commutative rank of matrix spaces
• Accurate and efficient evaluation of Schur and Jack functions
• Accurate Computations with Totally Nonnegative Matrices
• Analytic combinatorics
• Arithmetic circuits: a chasm at depth 3
• Arithmetic circuits: a survey of recent results and open questions
• Completeness and reduction in algebraic complexity theory
• Complexity of tropical Schur polynomials
• Depth-3 arithmetic circuits over fields of characteristic zero
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Diagonal Circuit Identity Testing and Lower Bounds
• Discovering the roots: uniform closure results for algebraic classes under factoring
• Fast Parallel Computation of Polynomials Using Few Processors
• Generatingfunctionology
• Hardness-randomness tradeoffs for bounded depth arithmetic circuits
• Homogeneous formulas and symmetric polynomials
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 7250153 (Why is no real title available?)
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• Lower bounds on arithmetic circuits via partial derivatives
• Normal subgroup reconstruction and quantum computation using group representations
• On computing Schur functions and series thereof
• On semiring complexity of Schur polynomials
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• On the number of reduced decompositions of elements of Coxeter groups
• On the ranks and border ranks of symmetric tensors
• On the relative power of reduction notions in arithmetic circuit complexity
• Partial derivatives in arithmetic complexity and beyond
• Rectangular Kronecker coefficients and plethysms in geometric complexity theory
• Subtraction-free complexity, cluster transformations, and spanning trees
• The shifted partial derivative complexity of elementary symmetric polynomials

Cited in

(2)

• Hirschman-Widder densities
• Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092463)