Pages that link to "Item:Q652454"

The following pages link to Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454):

Displaying 32 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
• Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
• Variant quantifier elimination (Q420753) (← links)
• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
• Computing characteristic classes of subschemes of smooth toric varieties (Q511874) (← links)
• On a generalization of Stickelberger's theorem (Q607067) (← links)
• A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
• Evaluation properties of invariant polynomials (Q731933) (← links)
• Effective approximation of the solutions of algebraic equations (Q820948) (← links)
• On sign conditions over real multivariate polynomials (Q977180) (← links)
• A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
• Deformation techniques for sparse systems (Q1029552) (← links)
• Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
• Complexity of triangular representations of algebraic sets (Q1714872) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Directed evaluation (Q2192677) (← links)
• Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
• Nœther bases and their applications (Q2330379) (← links)
• A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
• Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
• Change of order for regular chains in positive dimension (Q2476011) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Weak identifiability for differential algebraic systems (Q2701024) (← links)
• Puiseux Expansions and Nonisolated Points in Algebraic Varieties (Q2813651) (← links)
• AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES (Q2866055) (← links)
• Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
• Segre class computation and practical applications (Q5235111) (← links)
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system (Q6108370) (← links)
• Segre-driven radicality testing (Q6184180) (← links)