Pages that link to "Item:Q3218066"
From MaRDI portal
The following pages link to Short monotone formulae for the majority function (Q3218066):
Displaying 11 items.
- A limit theorem for continuous selectors (Q312333) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- Negation-limited formulas (Q729897) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Better lower bounds for monotone threshold formulas (Q1356879) (← links)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
- From discrepancy to majority (Q1751093) (← links)
- Optimal explicit small-depth formulas for the coin problem (Q6499272) (← links)
