scientific article; zbMATH DE number 2151804
From MaRDI portal
Publication:4661386
DOI10.1155/S1073792804142566zbMath1081.15003OpenAlexW2313549751MaRDI QIDQ4661386
Thierry Mignon, Nicolas Ressayre
Publication date: 4 April 2005
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/s1073792804142566
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45)
Related Items
A lower bound for the determinantal complexity of a hypersurface, Binary determinantal complexity, Quadratic lower bounds for algebraic branching programs and formulas, Rectangular Kronecker coefficients and plethysms in geometric complexity theory, Lower bounds for the circuit size of partially homogeneous polynomials, \(P\) versus \(NP\) and geometry, On the optimality of the Arf invariant formula for graph polynomials, Geometric complexity theory and matrix powering, Ulrich complexity, Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture, Vanishing symmetric Kronecker coefficients, On the Expressive Power of Read-Once Determinants, Permanent versus determinant: Not via saturations, Deterministic polynomial identity tests for multilinear bounded-read formulae, Interactions of computational complexity theory and mathematics, An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas, Lower bounds for the determinantal complexity of explicit low degree polynomials, Characterizing Valiant's algebraic complexity classes, On the complexity of the permanent in various computational models, Depth-4 lower bounds, determinantal complexity: a unified approach, No occurrence obstructions in geometric complexity theory, Algebraic Complexity Classes, Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials, A quadratic lower bound for algebraic branching programs, On the Symmetries of and Equivalence Test for Design Polynomials., $$P\mathop{ =}\limits^{?}NP$$, A quadratic lower bound for homogeneous algebraic branching programs, Linear projections of the Vandermonde polynomial, A lower bound on determinantal complexity, Geometric complexity theory: an introduction for geometers, Unifying known lower bounds via geometric complexity theory
