Pages that link to "Item:Q1007576"
From MaRDI portal
The following pages link to A lower bound for the hitting set size for combinatorial rectangles and an application (Q1007576):
Displaying 8 items.
- Recursive methods for some problems in coding and random permutations (Q831746) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Sharp concentration of hitting size for random set systems (Q2345531) (← links)
- Optimal Hitting Sets for Combinatorial Shapes (Q3167414) (← links)
- Optimal hitting sets for combinatorial shapes (Q3191583) (← links)
- (Q4501678) (← links)
- Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)
- On combinatorial rectangles with minimum ∞−discrepancy (Q5093423) (← links)