The following pages link to (Q4230351):
Displaying 6 items.
- A lower bound for computing Oja depth (Q1044726) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- On a relation between the depth and complexity of monotone Boolean formulas (Q5090140) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- The limits of depth reduction for arithmetic formulas (Q5259547) (← links)