The following pages link to Modern computer algebra (Q4248250):
Displaying 50 items.
- Index calculus in the trace zero variety (Q895005) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Improving the topology computation of an arrangement of cubics (Q945944) (← links)
- Rational solutions of ordinary difference equations (Q950423) (← links)
- On the \(q\)th power algorithm (Q958619) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Fast computation of Hermite normal forms of random integer matrices (Q984852) (← links)
- Probabilistic algorithms for computing resolvent representations of regular differential ideals (Q985372) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- A \(p\)-adic algorithm for computing the inverse of integer matrices (Q1004026) (← links)
- Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
- Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields (Q1017415) (← links)
- A parallel extended GCD algorithm (Q1018106) (← links)
- Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
- Linear dynamical systems over finite rings (Q1024384) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- Computing differential characteristic sets by change of ordering (Q1034554) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Linear recurrent sequences and polynomial roots (Q1394940) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- Subresultants revisited. (Q1401299) (← links)
- On lattice reduction for polynomial matrices (Q1401903) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- On computation of the greatest common divisor of several polynomials over a finite field. (Q1414018) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Computer algebra and algebraic geometry -- achievements and perspectives (Q1587227) (← links)
- On division polynomial PIT and supersingularity (Q1623917) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Primality testing with Gaussian periods (Q1737980) (← links)
- Indefinite summation of rational functions with factorization of denominators (Q1758695) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Computing zeta functions of Artin-Schreier curves over finite fields. II (Q1827573) (← links)
- Classical and quantum function reconstruction via character evaluation (Q1827578) (← links)
- Computing rational forms of integer matrices (Q1864883) (← links)
- Linear differential operators for polynomial equations (Q1864893) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) (Q1874655) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
