The following pages link to (Q4248250):
Displayed 50 items.
- 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)
- 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)
- Usage of modular techniques for efficient computation of ideal operations (Q1993362) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Symbolic analysis of multiple steady states in a MAPK chemical reaction network (Q1994887) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
- Dynamical irreducibility of polynomials modulo primes (Q2043070) (← links)
- 2-adic point counting on \(K3\) surfaces (Q2093672) (← links)
- Locating the closest singularity in a polynomial homotopy (Q2109994) (← links)
- On the number of solutions of systems of certain diagonal equations over finite fields (Q2116748) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Sparse polynomial interpolation based on diversification (Q2143469) (← links)
- Symbolic computations of first integrals for polynomial vector fields (Q2194771) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On the length of integers in telescopers for proper hypergeometric terms (Q2252118) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- On irreducible divisors of iterated polynomials (Q2256067) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Factorization patterns on nonlinear families of univariate polynomials over a finite field (Q2304196) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X]\) (Q2344290) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)