Pages that link to "Item:Q1914167"

The following pages link to A new polynomial factorization algorithm and its implementation (Q1914167):

Displaying 36 items.

• Genus 2 point counting over prime fields (Q412199) (← links)
• Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Algorithms for adaptive factorization of polynomials (Q1314605) (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
• \(\operatorname {SL}(2,11)\) is \({\mathbb Q}\)-admissible (Q1858252) (← links)
• A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
• A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
• A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
• Interval partitions and polynomial factorization (Q2429339) (← links)
• Fast computation of special resultants (Q2457312) (← links)
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
• Deterministic Encoding into Twisted Edwards Curves (Q2817819) (← links)
• Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
• Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme (Q3483364) (← links)
• A Hybrid Approach for Normal Factorization of Polynomials (Q3545103) (← links)
• Calculating the set of orders of elements in the finite linear groups (Q3545834) (← links)
• Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
• Code Generation for Polynomial Multiplication (Q3644088) (← links)
• (Q3757994) (← links)
• A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477) (← links)
• Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 (Q4235525) (← links)
• On a New Factorization Algorithm for Polynomials Over Finite Fields (Q4325734) (← links)
• Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
• Remarks on the Schoof-Elkies-Atkin algorithm (Q4396461) (← links)
• A solution to certain polynomial equations with applications to nonlinear fitting (Q4821050) (← links)
• (Q4848920) (← links)
• Implementing the Tangent Graeffe Root Finding Method (Q5041082) (← links)
• Fast convolutions meet Montgomery (Q5444325) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
• \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
• Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)