Vandermonde matrices, NP-completeness and transversal subspaces
From MaRDI portal
Publication:1430506
DOI10.1007/s10208-002-0076-4zbMath1050.15001OpenAlexW2156425035MaRDI QIDQ1430506
Hervé Fournier, Pascal Koiran, Leonid Gurvits, Alexander L. Chistov
Publication date: 27 May 2004
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-002-0076-4
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (15)
Higgledy-piggledy subspaces and uniform subspace designs ⋮ Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I ⋮ Efficient absolute factorization of polynomials with parametric coefficients ⋮ Refined bounds on the number of connected components of sign conditions on a variety ⋮ A polynomial bound on the number of comaximal localizations needed in order to make free a projective module ⋮ Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III ⋮ On the construction of a family of transversal subspaces over finite fields ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. II ⋮ Complexity of solving parametric polynomial systems ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. I ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. III ⋮ Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II ⋮ A bound for the degree of a system of equations determining the variety of reducible polynomials
This page was built for publication: Vandermonde matrices, NP-completeness and transversal subspaces
