The following pages link to (Q4248250):
Displayed 50 items.
- 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)
- 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)
- High-order lifting and integrality certification (Q1878491) (← links)
- Efficient data mappings for parity-declustered data layouts (Q1884842) (← links)
- Real closures of models of weak arithmetic (Q1935370) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions (Q2430021) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- Representation attacks on the Braid Diffie-Hellman public key encryption (Q2432563) (← links)
- Zero-nonzero and real-nonreal sign determination (Q2435509) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals (Q2457334) (← links)
- An algorithm to solve integer linear systems exactly using numerical methods (Q2457353) (← links)
- A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs (Q2457360) (← links)
- Polynomial root separation examples (Q2457387) (← links)