Pages that link to "Item:Q2913800"
From MaRDI portal
The following pages link to Computing polynomials with few multiplications (Q2913800):
Displaying 9 items.
- Computing with barycentric polynomials (Q1181866) (← links)
- Computing values of a polynomial with only few multiplications (Q1313709) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Arithmetic complexity in ring extensions (Q3002833) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications (Q4429698) (← links)
- (Q4708434) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- On the multiplicative complexity of polynomials (Q6548983) (← links)