Pages that link to "Item:Q862343"
From MaRDI portal
The following pages link to Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343):
Displaying 15 items.
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
- An efficient algorithm for product computations on computer (Q1132160) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (Q2979114) (← links)
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (Q3058727) (← links)
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Q3068644) (← links)
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q3519554) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Multiplicative complexity of polynomial multiplication over finite fields (Q3832671) (← links)
- A classification of algorithms for multiplying polynomials of small degree over finite fields (Q4015275) (← links)
- (Q4792309) (← links)
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184) (← links)
- STACS 2005 (Q5710701) (← links)
