Pages that link to "Item:Q5928586"
From MaRDI portal
The following pages link to Combinatorics of monotone computations (Q5928586):
Displaying 7 items.
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
