The following pages link to (Q5090425):
Displaying 12 items.
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- On polynomials with symmetric Galois group which are easy to compute (Q1098889) (← links)
- Rewriting techniques and degree bounds for higher order symmetric polynomials. (Q1304998) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- (Q3074627) (← links)
- (Q3735704) (← links)
- Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications (Q4429698) (← links)
- Concrete Multiplicative Complexity of Symmetric Functions (Q5756689) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)
