Pages that link to "Item:Q4907594"
From MaRDI portal
The following pages link to A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (Q4907594):
Displaying 6 items.
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Minkowski Complexity of Sets: An Easy Lower Bound (Q4575425) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
