The following pages link to (Q3992490):
Displaying 26 items.
- Improved bounds for the CF algorithm (Q385006) (← links)
- Symbolic-numerical solution of systems of linear ordinary differential equations with required accuracy (Q395276) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Sur la vie et l'oeuvre de François Budan (1761--1840). (On the life and work of F. Budan) (Q809060) (← links)
- Symbolic derivation of the equations of caustics about a crack tip (Q911355) (← links)
- An algebraic approach to rule based expert systems (Q981968) (← links)
- Does computer algebra help at all learning about real numbers? (Q1404700) (← links)
- On the Bézout construction of the resultant (Q1808661) (← links)
- Matrix computation of subresultant polynomial remainder sequences in integral domains (Q1904349) (← links)
- A Gröbner bases-based rule based expert system for fibromyalgia diagnosis (Q1935077) (← links)
- Symbolic and numerical analysis of the restricted five body problem using computer algebra (Q2017782) (← links)
- Invariant coordinate subspaces of normal form of a system of ordinary differential equations (Q2027853) (← links)
- A general method of finding new symplectic schemes for Hamiltonian mechanics (Q2109995) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
- The effect of the nonuniformity of the Earth's magnetic field on electrodynamic space tether system dynamics (Q2227915) (← links)
- Orthogonal polynomials and Möbius transformations (Q2245007) (← links)
- Localization of real algebraic hypersurfaces with applications to the enumeration of the classes of relative equilibria of a \((5+1)\)-body problem (Q2304276) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Algorithms and programs for calculating the roots of polynomial of one or two variables (Q2664516) (← links)
- Algorithme de Bareiss, algorithme des sous-résultants (Q3124402) (← links)
- An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy (Q3644101) (← links)
- Computing the reciprocal of units in Galois rings (Q4549929) (← links)
- An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases (Q6117702) (← links)
