Pages that link to "Item:Q4210096"
From MaRDI portal
The following pages link to Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (Q4210096):
Displaying 4 items.
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- A simple lower bound for monotone clique using a communication game (Q1190521) (← links)
- Improved depth lower bounds for small distance connectivity (Q1293359) (← links)
- Monotone separation of logarithmic space from logarithmic depth (Q1894451) (← links)