The following pages link to (Q4228449):
Displaying 6 items.
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
