Pages that link to "Item:Q293309"
From MaRDI portal
The following pages link to Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309):
Displaying 6 items.
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- On the relative complexity of resolution refinements and cutting planes proof systems (Q2706120) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)