The following pages link to Modern computer algebra (Q4248250):
Displaying 50 items.
- Factors of low individual degree polynomials (Q301529) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Computing modular Galois representations (Q379446) (← links)
- Symbolic-numerical solution of systems of linear ordinary differential equations with required accuracy (Q395276) (← links)
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Algebraic osculation and application to factorization of sparse polynomials (Q434417) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Sparse bivariate polynomial factorization (Q477285) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- A new method to compute the singularities of offsets to rational plane curves (Q492111) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
- Real solution isolation with multiplicity of zero-dimensional triangular systems (Q543162) (← links)
- An alternative class of irreducible polynomials for optimal extension fields (Q543428) (← links)
- An algebraic approach to continuous collision detection for ellipsoids (Q543838) (← links)
- Gcd of multivariate polynomials via Newton polytopes (Q545987) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- Distribution results for low-weight binary representations for pairs of integers (Q596061) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- The orbit problem is in the GapL hierarchy (Q626456) (← links)
- Polynomial algebra for Birkhoff interpolants (Q633149) (← links)
- Sparse interpolation of multivariate rational functions (Q633622) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- On coefficients of polynomials over finite fields (Q650833) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Redundancy of minimal weight expansions in Pisot bases (Q653321) (← links)
- Good reduction of Puiseux series and applications (Q654032) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- On multivariate rational function decomposition (Q697481) (← links)
- Irreducible decomposition of curves (Q697491) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Computability in linear algebra (Q703545) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Determining the closed forms of the anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra (Q711793) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- A worst-case bound for topology computation of algebraic curves (Q765857) (← links)
- Modular polynomials on Hilbert surfaces (Q784730) (← links)
- Affine equivalences of trigonometric curves (Q829601) (← links)
- Jebelean-Weber's algorithm without spurious factors (Q846018) (← links)
- Blending implicit interval curves and surfaces (Q846420) (← links)
- Multivariate subresultants in roots (Q852659) (← links)
