Pages that link to "Item:Q5363095"
From MaRDI portal
The following pages link to Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs (Q5363095):
Displaying 5 items.
- Strong inapproximability results on balanced rainbow-colorable hypergraphs (Q1715058) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)