The following pages link to (Q4501678):
Displaying 5 items.
- A lower bound for the hitting set size for combinatorial rectangles and an application (Q1007576) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)