Pages that link to "Item:Q1111380"
From MaRDI portal
The following pages link to On the complexity of the computation of certain classes of polynomials of several variables (Q1111380):
Displaying 14 items.
- On the cell probe complexity of polynomial evaluation (Q673647) (← links)
- On lower bounds for the complexity of polynomials and their multiples (Q1587343) (← links)
- On the complexity of computations on monomials and tuples of powers (Q1920145) (← links)
- Representation of monomials as a sum of powers of linear forms (Q2018019) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- (Q3421275) (← links)
- On the complexity of the ℰ2 Grzegorczyk class (Q3586259) (← links)
- On the Complexity of the Interlace Polynomial (Q4910711) (← links)
- On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials (Q5008364) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes (Q5066140) (← links)
- Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts (Q5226549) (← links)
- (Q5371447) (← links)
- Computational experiences on the distances of polynomials to irreducible polynomials (Q5691019) (← links)
