Pages that link to "Item:Q911294"

The following pages link to On the deterministic complexity of factoring polynomials over finite fields (Q911294):

Displaying 20 items.

• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
• Computational problems in the theory of finite fields (Q1180998) (← links)
• On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
• Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
• On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
• Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
• Sieve algorithms for perfect power testing (Q2366224) (← links)
• On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
• Constructing normal bases in finite fields (Q2639102) (← links)
• Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (Q3160743) (← links)
• Finding elliptic curves with a subgroup of prescribed size (Q3179510) (← links)
• (Q5009621) (← links)
• (Q5089209) (← links)
• Character sums and deterministic polynomial root finding in finite fields (Q5501155) (← links)
• Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation (Q6073976) (← links)