The following pages link to (Q4850731):
Displaying 36 items.
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Effective approximation of the solutions of algebraic equations (Q820948) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic (Q1358904) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Rational invariants of a group action. Construction and rewriting (Q2457418) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Weak identifiability for differential algebraic systems (Q2701024) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- (Q4714022) (← 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)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
