Pages that link to "Item:Q5432372"
From MaRDI portal
The following pages link to Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372):
Displaying 43 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Difference integrability conditions for parameterized linear difference and differential equations (Q395250) (← links)
- Additional recursion relations, factorizations, and diophantine properties associated with the polynomials of the Askey scheme (Q606091) (← links)
- Computing zeta functions of superelliptic curves in larger characteristic (Q626953) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Counting points on smooth plane quartics (Q2100591) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Counting points on hyperelliptic curves in average polynomial time (Q2445320) (← links)
- Improved algorithms for left factorial residues (Q2656342) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- A deterministic algorithm for integer factorization (Q2796032) (← links)
- Faster deterministic integer factorization (Q2862533) (← links)
- Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time (Q2878840) (← links)
- Computing -series of geometrically hyperelliptic curves of genus three (Q2971012) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- A babystep-giantstep method for faster deterministic integer factorization (Q3177725) (← links)
- A subquadratic algorithm for computing the $n$-th Bernoulli number (Q3189433) (← links)
- A search for Wilson primes (Q3189466) (← links)
- Computing zeta functions of arithmetic schemes (Q3466894) (← links)
- Fast integer multiplication using generalized Fermat primes (Q4612576) (← links)
- Computing zeta functions of generic projective hypersurfaces in larger characteristic (Q4683173) (← links)
- An exponent one-fifth algorithm for deterministic integer factorisation (Q4956932) (← links)
- Computing Hypergeometric Functions Rigorously (Q4960950) (← links)
- A time-space tradeoff for Lehman’s deterministic integer factorization method (Q4992239) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
- HYPERELLIPTIC CURVES, CARTIER — MANIN MATRICES AND LEGENDRE POLYNOMIALS (Q5151067) (← links)
- Hasse–Witt and Cartier–Manin matrices: A warning and a request (Q5236835) (← links)
- Deterministic factorization of sums and differences of powers (Q5270841) (← links)
- Variation of Néron–Severi Ranks of Reductions of K3 Surfaces (Q5498935) (← links)
- Counting points on superelliptic curves in average polynomial time (Q5853812) (← links)
- A Reduction of Integer Factorization to Modular Tetration (Q5859627) (← links)
- Deterministic factoring with oracles (Q6115442) (← links)
- Computing zeta functions of cyclic covers in large characteristic (Q6165854) (← links)
- Explicit Coleman integration in larger characteristic (Q6165858) (← links)
- Fast coefficient computation for algebraic power series in positive characteristic (Q6165860) (← links)
- Faster integer multiplication using short lattice vectors (Q6165872) (← links)
- A generalization of Lehman's method (Q6645972) (← links)
