Pages that link to "Item:Q3890111"
From MaRDI portal
The following pages link to On the depth complexity of formulas (Q3890111):
Displaying 16 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)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Monotone separations for constant degree polynomials (Q990088) (← links)
- Lower bounds on monotone arithmetic circuits with restricted depths (Q1070999) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- Lower bounds on the depth of monotone arithmetic computations (Q1288530) (← links)
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- On a relation between the depth and complexity of monotone Boolean formulas (Q5090140) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
