Pages that link to "Item:Q2366168"

The following pages link to Computing Frobenius maps and factoring polynomials (Q2366168):

Displaying 45 items.

• Modular composition modulo triangular sets and applications (Q371190) (← links)
• Genus 2 point counting over prime fields (Q412199) (← links)
• Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
• Counting curves and their projections (Q677992) (← links)
• Modular composition via factorization (Q722764) (← links)
• An algorithm for Lang's theorem. (Q731239) (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) (← links)
• Solving structured linear systems with large displacement rank (Q954988) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Fast rectangular matrix multiplication and applications (Q1271174) (← links)
• On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms (Q1361771) (← links)
• A generalisation of the Cantor-Zassenhaus algorithm (Q1377270) (← links)
• Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
• Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
• Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
• Factorization of a class of composed polynomials (Q2420476) (← links)
• Interval partitions and polynomial factorization (Q2429339) (← links)
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
• A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
• Smoothness testing of polynomials over finite fields (Q2513763) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Taking roots over high extensions of finite fields (Q2862538) (← links)
• Finding roots in with the successive resultants algorithm (Q2878836) (← links)
• The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
• Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
• Hensel lifting and bivariate polynomial factorisation over finite fields (Q3147180) (← links)
• Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
• A subquadratic algorithm for computing the $n$-th Bernoulli number (Q3189433) (← links)
• A search for Wilson primes (Q3189466) (← links)
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
• Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
• (Q5111252) (← links)
• On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
• Character sums and deterministic polynomial root finding in finite fields (Q5501155) (← links)
• Orienteering with one endomorphism (Q6093270) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)