Pages that link to "Item:Q5317184"

The following pages link to A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184):

Displaying 13 items.

• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials (Q332332) (← links)
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
• Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568) (← links)
• Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
• A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
• On lower bounds for the complexity of polynomials and their multiples (Q1587343) (← links)
• On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551) (← links)
• Lower bounds of complexity for polarized polynomials over finite fields (Q2002473) (← links)
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (Q2979114) (← links)
• Multiplicative complexity of polynomial multiplication over finite fields (Q3832671) (← links)
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras (Q3835017) (← links)
• STACS 2005 (Q5710701) (← links)
• (Q6062153) (← links)