Pages that link to "Item:Q4195943"
From MaRDI portal
The following pages link to On the Parallel Evaluation of Multivariate Polynomials (Q4195943):
Displaying 15 items.
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Computing multivariate polynomials in parallel (Q1166928) (← links)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5090938) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
