Pages that link to "Item:Q1380007"

The following pages link to Straight-line programs in geometric elimination theory (Q1380007):

Displaying 16 items.

• A probabilistic algorithm for computing data-discriminants of likelihood equations (Q2628325) (← links)
• Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
• Weak identifiability for differential algebraic systems (Q2701024) (← links)
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
• Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
• Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping (Q3597979) (← links)
• Modular equations for hyperelliptic curves (Q4821057) (← links)
• (Q5389777) (← links)
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS (Q5483452) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
• Computing bases of complete intersection rings in Noether position (Q5946450) (← links)
• Further perspectives on elimination (Q6166081) (← links)