Pages that link to "Item:Q4401061"
From MaRDI portal
The following pages link to Computer Algebra of Polynomials and Rational Functions (Q4401061):
Displaying 15 items.
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Klassifizierung torsionsfreier abelscher Gruppen des Ranges 2. II (Q1259695) (← links)
- Least order, stable solution of the exact model matching problem (Q1259998) (← links)
- A general factorization method for multivariable polynomials (Q1319369) (← links)
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) (Q1385406) (← links)
- Double Sylvester sums for subresultants and multi-Schur functions. (Q1394943) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Validity proof of Lazard's method for CAD construction (Q1757004) (← links)
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
- Exact Solution of Systems of Linear Equations with Iterative Methods (Q3968378) (← links)
- Factorization of<i>m</i>-D polynomials in linear<i>m</i>-D factors (Q4025762) (← links)
- (Q4364311) (← links)
- Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
