Pages that link to "Item:Q1715058"
From MaRDI portal
The following pages link to Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058):
Displaying 6 items.
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (Q5363095) (← links)
- Approximation and Online Algorithms (Q5713442) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)