Pages that link to "Item:Q1430506"

The following pages link to Vandermonde matrices, NP-completeness and transversal subspaces (Q1430506):

Displaying 15 items.

• Higgledy-piggledy subspaces and uniform subspace designs (Q281328) (← links)
• Refined bounds on the number of connected components of sign conditions on a variety (Q411399) (← links)
• A deterministic polynomial-time algorithm for the first Bertini theorem. I (Q744549) (← links)
• A deterministic polynomial-time algorithm for the first Bertini theorem. III (Q748510) (← links)
• On the construction of a family of transversal subspaces over finite fields (Q929484) (← links)
• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I (Q1661547) (← links)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III (Q2202706) (← links)
• A deterministic polynomial-time algorithm for the first Bertini theorem. II (Q2256657) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II (Q2307966) (← links)
• Efficient absolute factorization of polynomials with parametric coefficients (Q2406893) (← links)
• A polynomial bound on the number of comaximal localizations needed in order to make free a projective module (Q2431196) (← links)
• A bound for the degree of a system of equations determining the variety of reducible polynomials (Q2849092) (← links)
• On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)