Pages that link to "Item:Q5928586"
From MaRDI portal
The following pages link to Combinatorics of monotone computations (Q5928586):
Displaying 16 items.
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- A note on monotone real circuits (Q1685020) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- On the incompressibility of monotone DNFs (Q2642913) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- (Q4584040) (← links)
- Strongly exponential lower bounds for monotone computation (Q4978063) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)