Pages that link to "Item:Q4396457"

The following pages link to Subquadratic-time factoring of polynomials over finite fields (Q4396457):

Displaying 47 items.

• Complexity of computation in finite fields (Q378003) (← links)
• A new faster algorithm for factoring skew polynomials over finite fields (Q507150) (← links)
• Explicit computation of isomorphisms between finite fields (Q700165) (← links)
• Modular composition via factorization (Q722764) (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) (← links)
• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain (Q1033892) (← links)
• Factoring polynomials over arbitrary finite fields (Q1575686) (← 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)
• Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules (Q1800711) (← links)
• Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
• Fast computation of generic bivariate resultants (Q1996880) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\) (Q2130027) (← links)
• Interval partitions and polynomial factorization (Q2429339) (← links)
• Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
• Fast computation of special resultants (Q2457312) (← 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)
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Finding roots in with the successive resultants algorithm (Q2878836) (← links)
• Constructing irreducible polynomials over finite fields (Q2894527) (← links)
• Computing cardinalities of -curve reductions over finite fields (Q2971005) (← 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)
• On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
• Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
• The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
• Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• Modular equations for hyperelliptic curves (Q4821057) (← links)
• Factoring Polynomials over Local Fields II (Q4931656) (← links)
• Deterministic polynomial factoring and association schemes (Q5170254) (← links)
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator (Q5432372) (← 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)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• On the deterministic complexity of factoring polynomials (Q5928878) (← links)
• Factoring polynomials over local fields. (Q5950986) (← links)
• Skew differential Goppa codes and their application to McEliece cryptosystem (Q6070353) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
• Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)