Pages that link to "Item:Q1318755"
From MaRDI portal
The following pages link to A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755):
Displaying 8 items.
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
