Pages that link to "Item:Q1112792"
From MaRDI portal
The following pages link to A method for obtaining efficient lower bounds for monotone complexity (Q1112792):
Displaying 7 items.
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Symmetric approximation arguments for monotone lower bounds without sunflowers (Q1300606) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Lower bounds for monotonic list labeling (Q5056101) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)