Linear projections of the Vandermonde polynomial

DOI10.1016/j.tcs.2019.06.010zbMath1437.65019arXiv1705.03188OpenAlexW2963015644WikidataQ127567170 ScholiaQ127567170MaRDI QIDQ2330107

B. V. Raghavendra Rao, C. Ramya

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

algebraic complexity theorypolynomial equivalence problemVandermonde polynomials

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Polynomials in real and complex fields: factorization (12D05) Numerical computation of determinants (65F40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polynomials (irreducibility, etc.) (11R09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a simple polytope from its graph in polynomial time
• Affine projections of symmetric polynomials.
• Hilbert's Nullstellensatz is in the polynomial hierarchy
• Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
• Diagonal Circuit Identity Testing and Lower Bounds
• Sums of Like Powers of Multivariate Linear Forms
• Reconstruction of Full Rank Algebraic Branching Programs
• Geometry and Complexity Theory
• Affine projections of polynomials