Pages that link to "Item:Q5002681"
From MaRDI portal
The following pages link to NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors (Q5002681):
Displaying 10 items.
- The hardness of 3-uniform hypergraph coloring (Q2368586) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- (Q5092401) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- (Q5866345) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)