Pages that link to "Item:Q4863976"
From MaRDI portal
The following pages link to Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy (Q4863976):
Displaying 10 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Computing the maximum using \((\min,+)\) formulas (Q5111291) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)