Pages that link to "Item:Q2274408"

The following pages link to Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408):

Displaying 21 items.

• Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
• On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
• Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
• Asymptotics of 3-stack-sortable permutations (Q2034079) (← links)
• Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
• Polynomial modular product verification and its implications (Q2100047) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Directed evaluation (Q2192677) (← links)
• Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
• Fast amortized multi-point evaluation (Q2238846) (← links)
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
• Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
• Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
• Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
• (Q5150372) (← links)
• Orienteering with one endomorphism (Q6093270) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
• Symmetric encryption algorithms in a polynomial residue number system (Q6577838) (← links)
• Amortized bivariate multi-point evaluation (Q6666534) (← links)