Pages that link to "Item:Q3868771"
From MaRDI portal
The following pages link to An Improved Lower Bound on Polynomial Multiplication (Q3868771):
Displayed 8 items.
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- A lower bound for polynomial multiplication (Q1086218) (← links)
- Dense polynomial multiplication with reduced array manipulation overhead (Q1204791) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Maximal bilinear complexity and codes (Q2638779) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
- (Q6062153) (← links)