The following pages link to (Q3698903):
Displaying 50 items.
- Asymptotes of space curves (Q475664) (← links)
- Resultants over commutative idempotent semirings. I: Algebraic aspect (Q507140) (← links)
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617) (← links)
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- A new approach for constructing subresultants (Q864796) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- Generators of the ideal of an algebraic space curve (Q1030254) (← links)
- An efficient algorithm for the stratification and triangulation of an algebraic surface (Q1037650) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Computer algebra applied to itself (Q1106662) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve (Q1115496) (← links)
- A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials (Q1124738) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Cauchy index computation (Q1127957) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
- The inverse of an automorphism in polynomial time (Q1190750) (← links)
- Implicit representation of rational parametric surfaces (Q1198242) (← links)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- Double Sylvester sums for subresultants and multi-Schur functions. (Q1394943) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- Subresultants revisited. (Q1401299) (← links)
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. (Q1416272) (← links)
- New structure theorem for subresultants (Q1569836) (← links)
- Number of common roots and resultant of two tropical univariate polynomials (Q1663533) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- Recent advances on determining the number of real roots of parametric polynomials (Q1808669) (← links)
- Decomposing algebraic sets using Gröbner bases (Q1823621) (← links)
- Efficient topology determination of implicitly defined algebraic plane curves. (Q1852882) (← links)
- Computation of the dual of a plane projective curve (Q1864879) (← links)
- An algorithm for isolating the real solutions of semi-algebraic systems (Q1864897) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- The number of tetrahedra sharing the same metric invariants via symbolic and numerical computations (Q2048154) (← links)
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
- A condition for multiplicity structure of univariate polynomials (Q2229732) (← links)
- Improved polynomial remainder sequences for Ore polynomials (Q2437284) (← links)
- A subresultant-like theory for Buchberger's procedure (Q2452291) (← links)
- Birational properties of the gap subresultant varieties (Q2456534) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- A new approach to characterizing the relative position of two ellipses depending on one parameter (Q2499166) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- Algorithme de Bareiss, algorithme des sous-résultants (Q3124402) (← links)
