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 14 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)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- Lower bounds on the depth of monotone arithmetic computations (Q1288530) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
- On the Complexity of Matrix Product (Q4429689) (← 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)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)