The following pages link to (Q4248250):
Displayed 44 items.
- Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
- Efficient CM-constructions of elliptic curves over finite fields (Q3592699) (← links)
- An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy (Q3644101) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Fast integer multiplication using generalized Fermat primes (Q4612576) (← links)
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm (Q4651432) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping (Q4824817) (← links)
- The complete generating function for Gessel walks is algebraic (Q4929975) (← links)
- On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648) (← links)
- (Q5002654) (← links)
- Additive decompositions of polynomials over unique factorization domains (Q5132284) (← links)
- (Q5150372) (← links)
- (Q5150442) (← links)
- On modular inverses of cyclotomic polynomials and the magnitude of their coefficients (Q5169625) (← links)
- The van Hoeij Algorithm for Factoring Polynomials (Q5188544) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems (Q5386085) (← links)
- Computing Hilbert Class Polynomials (Q5387605) (← links)
- Computing Zeta Functions in Families of C a,b Curves Using Deformation (Q5387606) (← links)
- USING GRÖBNER BASES FOR FACTORING POLYNOMIALS OVER ALGEBRAIC EXTENSION FIELDS (Q5389511) (← links)
- An application of the method of additive chains to inversion in finite fields (Q5424089) (← links)
- $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms (Q5444320) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ (Q5452256) (← links)
- Refined Noether Normalization Theorem and Sharp Degree Bounds for Dominating Morphisms (Q5466698) (← links)
- Algorithms for Function Fields (Q5472015) (← links)
- EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS (Q5483452) (← links)
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography (Q5503300) (← links)
- Symbolic Computation Software Composability (Q5505509) (← links)
- (Q5743469) (← links)
- (Q5743490) (← links)
- Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315) (← links)
- Galois group computation for rational polynomials (Q5927989) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Fat Fisher zeroes (Q5945461) (← links)
- Factoring polynomials over local fields. (Q5950986) (← links)
- Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
- Isolating all the real roots of a mixed trigonometric-polynomial (Q6051116) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)
- Faster integer multiplication using short lattice vectors (Q6165872) (← links)