Pages that link to "Item:Q1332646"

The following pages link to An elimination method for polynomial systems (Q1332646):

Displaying 40 items.

• Sufficient and necessary center conditions for the Poincaré systems \(P(2, 2n) (n \leq 5)\) (Q410829) (← links)
• Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
• Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
• Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification (Q462854) (← links)
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers (Q611072) (← links)
• Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
• A bound for the Rosenfeld-Gröbner algorithm (Q928772) (← links)
• Elimination methods (Q1125620) (← links)
• Decomposing polynomial systems into simple systems (Q1264446) (← links)
• Computer algebra of polynomials: A modified method of eliminating unknowns (Q1385879) (← links)
• A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. (Q1416272) (← links)
• Computing triangular systems and regular systems (Q1582304) (← links)
• Specifications for triangulation algorithms of elementary-algebraic systems (Q1598480) (← links)
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
• Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
• Elimination theory in differential and difference algebra (Q1730314) (← links)
• On the theories of triangular sets (Q1808664) (← links)
• Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
• Polynomial systems from certain differential equations (Q1808674) (← links)
• Elimination procedures for mechanical theorem proving in geometry (Q1924738) (← links)
• Symbolic computation for the qualitative theory of differential equations (Q2080988) (← links)
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
• Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
• On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
• A numerical elimination method for polynomial computations (Q2378510) (← links)
• A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity (Q2400459) (← links)
• Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems (Q2643540) (← links)
• Ordering in solving systems of equations (Q2725987) (← links)
• A Method to Determine if Two Parametric Polynomial Systems Are Equal (Q2879174) (← links)
• (Q3806684) (← links)
• Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)
• On the Chordality of Simple Decomposition in Top-Down Style (Q5014670) (← links)
• Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition (Q5175452) (← links)
• Algebraic factoring and geometry theorem proving (Q5210786) (← links)
• Computer algebra methods in the study of nonlinear differential systems (Q5413125) (← links)
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)
• Computing the radical of an ideal in positive characteristic (Q5945292) (← links)
• Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros (Q6087590) (← links)
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system (Q6108370) (← links)
• Squarefree normal representation of zeros of zero-dimensional polynomial systems (Q6184184) (← links)